/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:37:55,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:37:55,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:37:55,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:37:55,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:37:55,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:37:55,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:37:55,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:37:55,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:37:55,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:37:55,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:37:55,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:37:55,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:37:55,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:37:55,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:37:55,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:37:55,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:37:55,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:37:55,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:37:55,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:37:55,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:37:55,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:37:55,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:37:55,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:37:55,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:37:55,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:37:55,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:37:55,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:37:55,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:37:55,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:37:55,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:37:55,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:37:55,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:37:55,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:37:55,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:37:55,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:37:55,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:37:55,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:37:55,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:37:55,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:37:55,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:37:55,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:37:55,562 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:37:55,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:37:55,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:37:55,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:37:55,565 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:37:55,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:37:55,565 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:37:55,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:37:55,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:37:55,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:37:55,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:37:55,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:37:55,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:37:55,568 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:37:55,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:37:55,568 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:37:55,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:37:55,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:37:55,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:37:55,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:37:55,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:37:55,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:37:55,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:37:55,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:37:55,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:37:55,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:37:55,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:37:55,570 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:37:55,571 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:37:55,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:37:55,571 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:37:55,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:37:55,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:37:55,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:37:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:37:55,891 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:37:55,892 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2020-10-16 13:37:55,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d50b573d8/606bdf26009044d4a8c18b28c90a8402/FLAG04aa59a5d [2020-10-16 13:37:56,502 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:37:56,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2020-10-16 13:37:56,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d50b573d8/606bdf26009044d4a8c18b28c90a8402/FLAG04aa59a5d [2020-10-16 13:37:56,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d50b573d8/606bdf26009044d4a8c18b28c90a8402 [2020-10-16 13:37:56,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:37:56,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:37:56,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:37:56,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:37:56,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:37:56,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:37:56" (1/1) ... [2020-10-16 13:37:56,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f963932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:56, skipping insertion in model container [2020-10-16 13:37:56,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:37:56" (1/1) ... [2020-10-16 13:37:56,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:37:56,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:37:57,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:37:57,307 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:37:57,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:37:57,456 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:37:57,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57 WrapperNode [2020-10-16 13:37:57,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:37:57,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:37:57,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:37:57,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:37:57,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:37:57,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:37:57,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:37:57,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:37:57,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... [2020-10-16 13:37:57,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:37:57,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:37:57,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:37:57,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:37:57,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:37:57,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:37:57,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:37:57,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:37:57,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:37:57,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:37:57,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:37:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:37:57,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:37:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:37:57,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:37:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:37:57,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:37:57,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:37:57,643 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:37:59,688 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:37:59,688 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:37:59,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:37:59 BoogieIcfgContainer [2020-10-16 13:37:59,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:37:59,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:37:59,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:37:59,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:37:59,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:37:56" (1/3) ... [2020-10-16 13:37:59,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d364d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:37:59, skipping insertion in model container [2020-10-16 13:37:59,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:57" (2/3) ... [2020-10-16 13:37:59,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d364d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:37:59, skipping insertion in model container [2020-10-16 13:37:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:37:59" (3/3) ... [2020-10-16 13:37:59,700 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2020-10-16 13:37:59,711 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:37:59,711 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:37:59,719 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:37:59,721 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:37:59,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,753 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,756 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,757 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,760 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,760 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,767 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,768 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:59,781 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:37:59,796 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:37:59,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:37:59,818 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:37:59,818 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:37:59,819 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:37:59,819 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:37:59,819 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:37:59,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:37:59,819 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:37:59,833 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:37:59,834 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 13:37:59,837 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 13:37:59,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 13:37:59,885 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 13:37:59,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:37:59,891 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 13:37:59,894 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 13:38:00,351 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 13:38:01,654 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 13:38:01,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:38:01,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:38:01,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:38:01,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:38:02,836 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 13:38:03,211 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:38:03,782 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 13:38:03,913 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 13:38:05,138 WARN L193 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-16 13:38:05,506 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 13:38:07,149 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 13:38:07,535 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:38:07,743 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-16 13:38:07,948 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 13:38:08,058 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 13:38:08,066 INFO L132 LiptonReduction]: Checked pairs total: 4800 [2020-10-16 13:38:08,066 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 13:38:08,073 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 13:38:08,133 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-16 13:38:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-16 13:38:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 13:38:08,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:08,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 13:38:08,143 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1043102, now seen corresponding path program 1 times [2020-10-16 13:38:08,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:08,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88423346] [2020-10-16 13:38:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:08,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88423346] [2020-10-16 13:38:08,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:08,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:38:08,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670674680] [2020-10-16 13:38:08,379 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:08,382 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:08,394 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-16 13:38:08,394 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:08,398 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:08,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:38:08,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:38:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:08,416 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-16 13:38:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:08,528 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 13:38:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:38:08,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 13:38:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:08,552 INFO L225 Difference]: With dead ends: 687 [2020-10-16 13:38:08,552 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 13:38:08,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 13:38:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 13:38:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 13:38:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 13:38:08,662 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-16 13:38:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:08,662 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 13:38:08,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:38:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 13:38:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:38:08,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:08,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:08,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:38:08,665 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -686129632, now seen corresponding path program 1 times [2020-10-16 13:38:08,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:08,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139833297] [2020-10-16 13:38:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:08,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139833297] [2020-10-16 13:38:08,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:08,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:38:08,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340450240] [2020-10-16 13:38:08,818 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:08,820 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:08,821 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:38:08,822 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:08,822 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:08,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:38:08,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:38:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:08,824 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 13:38:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:08,838 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-16 13:38:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:38:08,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:38:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:08,846 INFO L225 Difference]: With dead ends: 537 [2020-10-16 13:38:08,847 INFO L226 Difference]: Without dead ends: 537 [2020-10-16 13:38:08,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-16 13:38:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-16 13:38:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-16 13:38:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-16 13:38:08,883 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2020-10-16 13:38:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:08,884 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-16 13:38:08,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:38:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-16 13:38:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:38:08,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:08,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:08,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:38:08,887 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 204142204, now seen corresponding path program 1 times [2020-10-16 13:38:08,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:08,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975571099] [2020-10-16 13:38:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:09,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975571099] [2020-10-16 13:38:09,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:09,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:38:09,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820549764] [2020-10-16 13:38:09,038 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:09,039 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:09,042 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-10-16 13:38:09,042 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:09,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,096 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:09,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:38:09,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:38:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:09,098 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-10-16 13:38:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:09,131 INFO L93 Difference]: Finished difference Result 533 states and 1620 transitions. [2020-10-16 13:38:09,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:38:09,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 13:38:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:09,138 INFO L225 Difference]: With dead ends: 533 [2020-10-16 13:38:09,138 INFO L226 Difference]: Without dead ends: 533 [2020-10-16 13:38:09,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-16 13:38:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-10-16 13:38:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-10-16 13:38:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions. [2020-10-16 13:38:09,169 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10 [2020-10-16 13:38:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:09,170 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions. [2020-10-16 13:38:09,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:38:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions. [2020-10-16 13:38:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:38:09,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:09,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:09,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:38:09,175 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 925932103, now seen corresponding path program 1 times [2020-10-16 13:38:09,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:09,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896952002] [2020-10-16 13:38:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:09,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896952002] [2020-10-16 13:38:09,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:09,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:38:09,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988248292] [2020-10-16 13:38:09,251 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:09,254 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:09,257 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-10-16 13:38:09,257 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:09,317 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:09,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:38:09,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:38:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:38:09,319 INFO L87 Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 4 states. [2020-10-16 13:38:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:09,353 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-10-16 13:38:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:38:09,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:38:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:09,357 INFO L225 Difference]: With dead ends: 677 [2020-10-16 13:38:09,357 INFO L226 Difference]: Without dead ends: 377 [2020-10-16 13:38:09,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:38:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-16 13:38:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-16 13:38:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 13:38:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-10-16 13:38:09,370 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 11 [2020-10-16 13:38:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:09,371 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-10-16 13:38:09,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:38:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-10-16 13:38:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:38:09,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:09,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:09,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:38:09,373 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 828724729, now seen corresponding path program 1 times [2020-10-16 13:38:09,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:09,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120457139] [2020-10-16 13:38:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:09,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120457139] [2020-10-16 13:38:09,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:09,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:38:09,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455080199] [2020-10-16 13:38:09,471 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:09,473 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:09,476 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-16 13:38:09,477 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:09,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:38:09,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:38:09,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,521 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,532 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:38:09,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,560 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:38:09,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,592 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:38:09,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,593 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:38:09,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,594 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,627 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,631 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:38:09,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:38:09,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:38:09,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:09,661 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:09,683 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:38:09,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:09,710 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:09,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:38:09,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:38:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:38:09,712 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 4 states. [2020-10-16 13:38:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:09,766 INFO L93 Difference]: Finished difference Result 365 states and 1036 transitions. [2020-10-16 13:38:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:38:09,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 13:38:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:09,770 INFO L225 Difference]: With dead ends: 365 [2020-10-16 13:38:09,770 INFO L226 Difference]: Without dead ends: 365 [2020-10-16 13:38:09,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:38:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-10-16 13:38:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-10-16 13:38:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-16 13:38:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions. [2020-10-16 13:38:09,782 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 12 [2020-10-16 13:38:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:09,783 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions. [2020-10-16 13:38:09,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:38:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions. [2020-10-16 13:38:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:38:09,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:09,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:09,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:38:09,785 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -79337433, now seen corresponding path program 1 times [2020-10-16 13:38:09,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:09,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906880898] [2020-10-16 13:38:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:09,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906880898] [2020-10-16 13:38:09,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:09,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:38:09,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425857607] [2020-10-16 13:38:09,986 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:09,989 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:09,994 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2020-10-16 13:38:09,995 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:10,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:38:10,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,038 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,045 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:38:10,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,058 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:10,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:38:10,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,099 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:10,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,113 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:38:10,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,171 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,173 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:38:10,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,218 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:10,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:38:10,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:38:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:38:10,220 INFO L87 Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand 5 states. [2020-10-16 13:38:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:10,371 INFO L93 Difference]: Finished difference Result 441 states and 1256 transitions. [2020-10-16 13:38:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:38:10,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 13:38:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:10,376 INFO L225 Difference]: With dead ends: 441 [2020-10-16 13:38:10,377 INFO L226 Difference]: Without dead ends: 441 [2020-10-16 13:38:10,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:38:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-16 13:38:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-16 13:38:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-16 13:38:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1256 transitions. [2020-10-16 13:38:10,391 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1256 transitions. Word has length 13 [2020-10-16 13:38:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:10,392 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1256 transitions. [2020-10-16 13:38:10,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:38:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1256 transitions. [2020-10-16 13:38:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:38:10,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:10,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:10,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:38:10,394 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1835505222, now seen corresponding path program 1 times [2020-10-16 13:38:10,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:10,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159113318] [2020-10-16 13:38:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:10,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159113318] [2020-10-16 13:38:10,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:10,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:38:10,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609279521] [2020-10-16 13:38:10,777 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:10,782 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:10,788 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 42 transitions. [2020-10-16 13:38:10,788 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:10,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:38:10,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-16 13:38:10,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:38:10,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:38:10,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:38:10,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,826 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:10,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:10,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:38:10,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-16 13:38:10,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-16 13:38:10,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:38:10,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-16 13:38:10,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:10,977 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:10,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:38:10,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:38:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:38:10,979 INFO L87 Difference]: Start difference. First operand 441 states and 1256 transitions. Second operand 6 states. [2020-10-16 13:38:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:11,184 INFO L93 Difference]: Finished difference Result 457 states and 1292 transitions. [2020-10-16 13:38:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:38:11,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 13:38:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:11,192 INFO L225 Difference]: With dead ends: 457 [2020-10-16 13:38:11,192 INFO L226 Difference]: Without dead ends: 457 [2020-10-16 13:38:11,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:38:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-10-16 13:38:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 389. [2020-10-16 13:38:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-10-16 13:38:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1094 transitions. [2020-10-16 13:38:11,204 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1094 transitions. Word has length 14 [2020-10-16 13:38:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:11,205 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 1094 transitions. [2020-10-16 13:38:11,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:38:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1094 transitions. [2020-10-16 13:38:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:38:11,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:11,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:11,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:38:11,207 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -470461144, now seen corresponding path program 1 times [2020-10-16 13:38:11,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:11,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481895362] [2020-10-16 13:38:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:11,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481895362] [2020-10-16 13:38:11,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:11,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:38:11,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478770611] [2020-10-16 13:38:11,500 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:11,502 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:11,506 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-16 13:38:11,506 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:11,537 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:11,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:38:11,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:38:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:38:11,539 INFO L87 Difference]: Start difference. First operand 389 states and 1094 transitions. Second operand 7 states. [2020-10-16 13:38:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:11,733 INFO L93 Difference]: Finished difference Result 467 states and 1320 transitions. [2020-10-16 13:38:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:38:11,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 13:38:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:11,738 INFO L225 Difference]: With dead ends: 467 [2020-10-16 13:38:11,738 INFO L226 Difference]: Without dead ends: 467 [2020-10-16 13:38:11,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:38:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-10-16 13:38:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 419. [2020-10-16 13:38:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-16 13:38:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1192 transitions. [2020-10-16 13:38:11,753 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1192 transitions. Word has length 15 [2020-10-16 13:38:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:11,753 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1192 transitions. [2020-10-16 13:38:11,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:38:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1192 transitions. [2020-10-16 13:38:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:38:11,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:11,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:11,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:38:11,755 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1066091366, now seen corresponding path program 2 times [2020-10-16 13:38:11,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:11,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385136031] [2020-10-16 13:38:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:12,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385136031] [2020-10-16 13:38:12,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:12,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:38:12,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [726823576] [2020-10-16 13:38:12,109 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:12,113 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:12,119 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2020-10-16 13:38:12,119 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:12,153 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:12,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:12,170 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:38:12,173 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:38:12,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,182 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:38:12,201 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,206 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:12,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,213 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:38:12,218 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,232 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:12,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,242 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:38:12,243 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,248 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:38:12,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:38:12,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:38:12,314 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13213#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)))] [2020-10-16 13:38:12,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:38:12,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:38:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:38:12,316 INFO L87 Difference]: Start difference. First operand 419 states and 1192 transitions. Second operand 8 states. [2020-10-16 13:38:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:12,536 INFO L93 Difference]: Finished difference Result 577 states and 1601 transitions. [2020-10-16 13:38:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:38:12,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 13:38:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:12,541 INFO L225 Difference]: With dead ends: 577 [2020-10-16 13:38:12,541 INFO L226 Difference]: Without dead ends: 541 [2020-10-16 13:38:12,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:38:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-10-16 13:38:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 415. [2020-10-16 13:38:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-10-16 13:38:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1157 transitions. [2020-10-16 13:38:12,555 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1157 transitions. Word has length 15 [2020-10-16 13:38:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:12,555 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 1157 transitions. [2020-10-16 13:38:12,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:38:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1157 transitions. [2020-10-16 13:38:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:38:12,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:12,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:12,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:38:12,557 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1066077478, now seen corresponding path program 1 times [2020-10-16 13:38:12,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:12,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691539262] [2020-10-16 13:38:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:12,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691539262] [2020-10-16 13:38:12,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:12,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:38:12,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933232190] [2020-10-16 13:38:12,594 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:12,596 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:12,602 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2020-10-16 13:38:12,602 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:12,618 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:12,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:38:12,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:38:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:12,619 INFO L87 Difference]: Start difference. First operand 415 states and 1157 transitions. Second operand 3 states. [2020-10-16 13:38:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:12,631 INFO L93 Difference]: Finished difference Result 631 states and 1724 transitions. [2020-10-16 13:38:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:38:12,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-16 13:38:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:12,634 INFO L225 Difference]: With dead ends: 631 [2020-10-16 13:38:12,635 INFO L226 Difference]: Without dead ends: 341 [2020-10-16 13:38:12,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:38:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-10-16 13:38:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 329. [2020-10-16 13:38:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-10-16 13:38:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 840 transitions. [2020-10-16 13:38:12,645 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 840 transitions. Word has length 15 [2020-10-16 13:38:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:12,645 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 840 transitions. [2020-10-16 13:38:12,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:38:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 840 transitions. [2020-10-16 13:38:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:38:12,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:12,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:12,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:38:12,647 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1795300676, now seen corresponding path program 2 times [2020-10-16 13:38:12,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:12,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59297255] [2020-10-16 13:38:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:12,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59297255] [2020-10-16 13:38:12,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:12,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:38:12,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630360320] [2020-10-16 13:38:12,715 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:12,718 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:12,724 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-10-16 13:38:12,725 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:12,729 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:12,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:38:12,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:38:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:38:12,730 INFO L87 Difference]: Start difference. First operand 329 states and 840 transitions. Second operand 4 states. [2020-10-16 13:38:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:12,764 INFO L93 Difference]: Finished difference Result 328 states and 747 transitions. [2020-10-16 13:38:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:38:12,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 13:38:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:12,766 INFO L225 Difference]: With dead ends: 328 [2020-10-16 13:38:12,766 INFO L226 Difference]: Without dead ends: 247 [2020-10-16 13:38:12,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:38:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-10-16 13:38:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2020-10-16 13:38:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-16 13:38:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 556 transitions. [2020-10-16 13:38:12,773 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 556 transitions. Word has length 15 [2020-10-16 13:38:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:12,774 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 556 transitions. [2020-10-16 13:38:12,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:38:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 556 transitions. [2020-10-16 13:38:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:38:12,775 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:12,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:12,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:38:12,775 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash 233532823, now seen corresponding path program 1 times [2020-10-16 13:38:12,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:12,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383747054] [2020-10-16 13:38:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:12,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383747054] [2020-10-16 13:38:12,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:12,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:38:12,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505691258] [2020-10-16 13:38:12,865 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:12,867 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:12,879 INFO L258 McrAutomatonBuilder]: Finished intersection with 71 states and 133 transitions. [2020-10-16 13:38:12,879 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:12,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:12,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:13,096 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:38:13,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:38:13,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:38:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:38:13,097 INFO L87 Difference]: Start difference. First operand 247 states and 556 transitions. Second operand 5 states. [2020-10-16 13:38:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:13,137 INFO L93 Difference]: Finished difference Result 212 states and 432 transitions. [2020-10-16 13:38:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:38:13,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 13:38:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:13,139 INFO L225 Difference]: With dead ends: 212 [2020-10-16 13:38:13,139 INFO L226 Difference]: Without dead ends: 168 [2020-10-16 13:38:13,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 17 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:38:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-10-16 13:38:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-10-16 13:38:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-16 13:38:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 335 transitions. [2020-10-16 13:38:13,144 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 335 transitions. Word has length 16 [2020-10-16 13:38:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:13,144 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 335 transitions. [2020-10-16 13:38:13,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:38:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 335 transitions. [2020-10-16 13:38:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:38:13,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:13,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:13,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:38:13,146 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1725380069, now seen corresponding path program 1 times [2020-10-16 13:38:13,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:13,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383426106] [2020-10-16 13:38:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:13,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383426106] [2020-10-16 13:38:13,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:13,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:38:13,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283812281] [2020-10-16 13:38:13,522 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:13,524 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:13,530 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-10-16 13:38:13,530 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:13,631 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17308#(and (<= ~z$w_buff1_used~0 0) (<= 0 ~z$w_buff1_used~0) (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$r_buff1_thd3~0 0))] [2020-10-16 13:38:13,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:38:13,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:38:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:38:13,632 INFO L87 Difference]: Start difference. First operand 168 states and 335 transitions. Second operand 9 states. [2020-10-16 13:38:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:13,891 INFO L93 Difference]: Finished difference Result 191 states and 371 transitions. [2020-10-16 13:38:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:38:13,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-16 13:38:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:13,893 INFO L225 Difference]: With dead ends: 191 [2020-10-16 13:38:13,893 INFO L226 Difference]: Without dead ends: 135 [2020-10-16 13:38:13,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-16 13:38:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-16 13:38:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-10-16 13:38:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-16 13:38:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-10-16 13:38:13,898 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-10-16 13:38:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:13,898 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-10-16 13:38:13,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:38:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-10-16 13:38:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:38:13,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:13,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:13,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:38:13,899 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash 903386731, now seen corresponding path program 1 times [2020-10-16 13:38:13,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:13,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494652696] [2020-10-16 13:38:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:38:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:38:13,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494652696] [2020-10-16 13:38:13,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:38:13,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:38:13,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868070659] [2020-10-16 13:38:13,990 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:38:13,992 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:38:14,006 INFO L258 McrAutomatonBuilder]: Finished intersection with 71 states and 124 transitions. [2020-10-16 13:38:14,007 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:38:14,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:38:14,144 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17760#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:38:14,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:38:14,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:38:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:38:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:38:14,145 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 7 states. [2020-10-16 13:38:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:38:14,194 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-10-16 13:38:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:38:14,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-16 13:38:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:38:14,196 INFO L225 Difference]: With dead ends: 111 [2020-10-16 13:38:14,196 INFO L226 Difference]: Without dead ends: 62 [2020-10-16 13:38:14,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:38:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-16 13:38:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-16 13:38:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-16 13:38:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-16 13:38:14,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-16 13:38:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:38:14,199 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-16 13:38:14,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:38:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-16 13:38:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:38:14,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:38:14,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:38:14,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 13:38:14,201 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:38:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:38:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -266848583, now seen corresponding path program 1 times [2020-10-16 13:38:14,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:38:14,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586167341] [2020-10-16 13:38:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:38:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:38:14,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:38:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:38:14,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:38:14,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:38:14,320 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:38:14,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 13:38:14,321 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:38:14,335 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L816-->L823: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In2076431630 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In2076431630 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In2076431630 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In2076431630 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In2076431630 ~z$r_buff1_thd0~0_Out2076431630) (or (and .cse0 (= ~z$w_buff1_used~0_Out2076431630 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out2076431630 ~z$w_buff1_used~0_In2076431630))) (or (and .cse3 (= ~z~0_Out2076431630 ~z$w_buff0~0_In2076431630) .cse4) (and .cse5 (or (and .cse0 (= ~z$w_buff1~0_In2076431630 ~z~0_Out2076431630) .cse1) (and .cse2 (= ~z~0_In2076431630 ~z~0_Out2076431630))))) (= ~z$r_buff0_thd0~0_In2076431630 ~z$r_buff0_thd0~0_Out2076431630) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2076431630 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2076431630|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2076431630 0)) (or (and (= ~z$w_buff0_used~0_Out2076431630 0) .cse3 .cse4) (and (= ~z$w_buff0_used~0_Out2076431630 ~z$w_buff0_used~0_In2076431630) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2076431630|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2076431630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2076431630, ~z$w_buff0~0=~z$w_buff0~0_In2076431630, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2076431630, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2076431630, ~z$w_buff1~0=~z$w_buff1~0_In2076431630, ~z~0=~z~0_In2076431630} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2076431630|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2076431630, ~z$w_buff0~0=~z$w_buff0~0_In2076431630, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2076431630, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2076431630|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2076431630|, ~z$w_buff1~0=~z$w_buff1~0_In2076431630, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2076431630|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2076431630|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2076431630|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2076431630|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out2076431630, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2076431630, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2076431630, ~z~0=~z~0_Out2076431630} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 13:38:14,341 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,343 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,343 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,343 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:38:14,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:38:14,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:14 BasicIcfg [2020-10-16 13:38:14,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:38:14,437 INFO L168 Benchmark]: Toolchain (without parser) took 17667.83 ms. Allocated memory was 140.5 MB in the beginning and 379.1 MB in the end (delta: 238.6 MB). Free memory was 101.7 MB in the beginning and 137.0 MB in the end (delta: -35.3 MB). Peak memory consumption was 203.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,437 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:38:14,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.68 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 101.5 MB in the beginning and 155.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,439 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,440 INFO L168 Benchmark]: RCFGBuilder took 2117.06 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 150.0 MB in the beginning and 160.2 MB in the end (delta: -10.2 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,441 INFO L168 Benchmark]: TraceAbstraction took 14742.65 ms. Allocated memory was 246.9 MB in the beginning and 379.1 MB in the end (delta: 132.1 MB). Free memory was 160.2 MB in the beginning and 137.0 MB in the end (delta: 23.2 MB). Peak memory consumption was 155.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:38:14,444 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 688.68 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 101.5 MB in the beginning and 155.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2117.06 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 150.0 MB in the beginning and 160.2 MB in the end (delta: -10.2 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14742.65 ms. Allocated memory was 246.9 MB in the beginning and 379.1 MB in the end (delta: 132.1 MB). Free memory was 160.2 MB in the beginning and 137.0 MB in the end (delta: 23.2 MB). Peak memory consumption was 155.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 840 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 74 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4800 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2040; [L808] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2041; [L810] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t2042; [L812] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L782] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 290 SDtfs, 300 SDslu, 539 SDs, 0 SdLazy, 348 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 134 SyntacticMatches, 44 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 265 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 29584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...