/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 18:22:00,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 18:22:00,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 18:22:00,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 18:22:00,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 18:22:00,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 18:22:00,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 18:22:00,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 18:22:00,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 18:22:00,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 18:22:00,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 18:22:00,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 18:22:00,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 18:22:00,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 18:22:00,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 18:22:00,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 18:22:00,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 18:22:00,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 18:22:00,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 18:22:00,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 18:22:00,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 18:22:00,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 18:22:00,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 18:22:00,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 18:22:00,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 18:22:00,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 18:22:00,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 18:22:00,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 18:22:00,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 18:22:00,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 18:22:00,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 18:22:00,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 18:22:00,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 18:22:00,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 18:22:00,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 18:22:00,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 18:22:00,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 18:22:00,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 18:22:00,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 18:22:00,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 18:22:00,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 18:22:00,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 18:22:00,459 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 18:22:00,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 18:22:00,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 18:22:00,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 18:22:00,461 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 18:22:00,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 18:22:00,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 18:22:00,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 18:22:00,463 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 18:22:00,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 18:22:00,463 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 18:22:00,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 18:22:00,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 18:22:00,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 18:22:00,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 18:22:00,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 18:22:00,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 18:22:00,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 18:22:00,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 18:22:00,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 18:22:00,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 18:22:00,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:00,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 18:22:00,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 18:22:00,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 18:22:00,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 18:22:00,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 18:22:00,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 18:22:00,756 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 18:22:00,756 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 18:22:00,757 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 18:22:00,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d231532c8/858264515e1246e4825c311534d66fdc/FLAG99f66b055 [2020-07-20 18:22:01,250 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 18:22:01,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 18:22:01,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d231532c8/858264515e1246e4825c311534d66fdc/FLAG99f66b055 [2020-07-20 18:22:01,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d231532c8/858264515e1246e4825c311534d66fdc [2020-07-20 18:22:01,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 18:22:01,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 18:22:01,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:01,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 18:22:01,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 18:22:01,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:01,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6651e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01, skipping insertion in model container [2020-07-20 18:22:01,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:01,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 18:22:01,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 18:22:01,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:01,919 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 18:22:01,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:01,969 INFO L208 MainTranslator]: Completed translation [2020-07-20 18:22:01,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01 WrapperNode [2020-07-20 18:22:01,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:01,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 18:22:01,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 18:22:01,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 18:22:02,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... [2020-07-20 18:22:02,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 18:22:02,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 18:22:02,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 18:22:02,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 18:22:02,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-20 18:22:02,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 18:22:02,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 18:22:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 18:22:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 18:22:02,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 18:22:02,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 18:22:02,163 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 18:22:02,163 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 18:22:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 18:22:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 18:22:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 18:22:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 18:22:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 18:22:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 18:22:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 18:22:02,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 18:22:02,581 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 18:22:02,581 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 18:22:02,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:02 BoogieIcfgContainer [2020-07-20 18:22:02,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 18:22:02,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 18:22:02,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 18:22:02,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 18:22:02,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:22:01" (1/3) ... [2020-07-20 18:22:02,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dd207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:02, skipping insertion in model container [2020-07-20 18:22:02,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:01" (2/3) ... [2020-07-20 18:22:02,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dd207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:02, skipping insertion in model container [2020-07-20 18:22:02,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:02" (3/3) ... [2020-07-20 18:22:02,594 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 18:22:02,604 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 18:22:02,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 18:22:02,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 18:22:02,653 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 18:22:02,653 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 18:22:02,653 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 18:22:02,653 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 18:22:02,654 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 18:22:02,654 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 18:22:02,654 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 18:22:02,654 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 18:22:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 18:22:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 18:22:02,685 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:02,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:02,686 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 18:22:02,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:02,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251232160] [2020-07-20 18:22:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:02,954 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:02,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:02,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:02,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:03,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:03,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251232160] [2020-07-20 18:22:03,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:03,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:03,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139709241] [2020-07-20 18:22:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:03,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:03,048 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-20 18:22:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:03,144 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2020-07-20 18:22:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:03,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-20 18:22:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:03,163 INFO L225 Difference]: With dead ends: 279 [2020-07-20 18:22:03,163 INFO L226 Difference]: Without dead ends: 175 [2020-07-20 18:22:03,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-07-20 18:22:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-20 18:22:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-20 18:22:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-20 18:22:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2020-07-20 18:22:03,245 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2020-07-20 18:22:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:03,246 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2020-07-20 18:22:03,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2020-07-20 18:22:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 18:22:03,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:03,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:03,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:03,468 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-20 18:22:03,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:03,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682698926] [2020-07-20 18:22:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:03,613 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:03,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:03,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 18:22:03,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:03,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:03,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682698926] [2020-07-20 18:22:03,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:03,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:03,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219027948] [2020-07-20 18:22:03,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:03,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:03,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:03,670 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 3 states. [2020-07-20 18:22:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:03,712 INFO L93 Difference]: Finished difference Result 368 states and 491 transitions. [2020-07-20 18:22:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:03,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 18:22:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:03,717 INFO L225 Difference]: With dead ends: 368 [2020-07-20 18:22:03,717 INFO L226 Difference]: Without dead ends: 217 [2020-07-20 18:22:03,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-07-20 18:22:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2020-07-20 18:22:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-07-20 18:22:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 241 transitions. [2020-07-20 18:22:03,750 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 241 transitions. Word has length 66 [2020-07-20 18:22:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:03,751 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 241 transitions. [2020-07-20 18:22:03,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 241 transitions. [2020-07-20 18:22:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 18:22:03,755 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:03,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:03,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:03,970 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash 258652184, now seen corresponding path program 1 times [2020-07-20 18:22:03,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:03,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367415693] [2020-07-20 18:22:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:04,031 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:04,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:04,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:04,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:04,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:04,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367415693] [2020-07-20 18:22:04,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:04,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:04,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788524001] [2020-07-20 18:22:04,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:04,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:04,059 INFO L87 Difference]: Start difference. First operand 189 states and 241 transitions. Second operand 3 states. [2020-07-20 18:22:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:04,084 INFO L93 Difference]: Finished difference Result 358 states and 459 transitions. [2020-07-20 18:22:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:04,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 18:22:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:04,088 INFO L225 Difference]: With dead ends: 358 [2020-07-20 18:22:04,088 INFO L226 Difference]: Without dead ends: 186 [2020-07-20 18:22:04,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-07-20 18:22:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-20 18:22:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-07-20 18:22:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-07-20 18:22:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2020-07-20 18:22:04,114 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 66 [2020-07-20 18:22:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:04,114 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2020-07-20 18:22:04,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2020-07-20 18:22:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-20 18:22:04,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:04,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:04,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:04,334 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1757497946, now seen corresponding path program 1 times [2020-07-20 18:22:04,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:04,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970559308] [2020-07-20 18:22:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:04,460 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:04,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:04,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:04,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:04,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:04,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970559308] [2020-07-20 18:22:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:04,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311909297] [2020-07-20 18:22:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:04,512 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand 5 states. [2020-07-20 18:22:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:05,038 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2020-07-20 18:22:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:05,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-07-20 18:22:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:05,044 INFO L225 Difference]: With dead ends: 587 [2020-07-20 18:22:05,044 INFO L226 Difference]: Without dead ends: 418 [2020-07-20 18:22:05,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-20 18:22:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 374. [2020-07-20 18:22:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-07-20 18:22:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 521 transitions. [2020-07-20 18:22:05,131 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 521 transitions. Word has length 72 [2020-07-20 18:22:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:05,134 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 521 transitions. [2020-07-20 18:22:05,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 521 transitions. [2020-07-20 18:22:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 18:22:05,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:05,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:05,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:05,346 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:05,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-20 18:22:05,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:05,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393810437] [2020-07-20 18:22:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:05,447 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:05,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:05,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-20 18:22:05,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:05,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:05,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393810437] [2020-07-20 18:22:05,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:05,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:05,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262267876] [2020-07-20 18:22:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:05,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:05,469 INFO L87 Difference]: Start difference. First operand 374 states and 521 transitions. Second operand 3 states. [2020-07-20 18:22:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:05,519 INFO L93 Difference]: Finished difference Result 749 states and 1084 transitions. [2020-07-20 18:22:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:05,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 18:22:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:05,523 INFO L225 Difference]: With dead ends: 749 [2020-07-20 18:22:05,524 INFO L226 Difference]: Without dead ends: 392 [2020-07-20 18:22:05,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-07-20 18:22:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-07-20 18:22:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 387. [2020-07-20 18:22:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-07-20 18:22:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 541 transitions. [2020-07-20 18:22:05,560 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 541 transitions. Word has length 66 [2020-07-20 18:22:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:05,560 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 541 transitions. [2020-07-20 18:22:05,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 541 transitions. [2020-07-20 18:22:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 18:22:05,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:05,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:05,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:05,778 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -490335048, now seen corresponding path program 1 times [2020-07-20 18:22:05,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:05,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203130739] [2020-07-20 18:22:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:05,871 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:05,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:05,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:05,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:05,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:05,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203130739] [2020-07-20 18:22:05,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:05,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:05,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521147992] [2020-07-20 18:22:05,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:05,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:05,910 INFO L87 Difference]: Start difference. First operand 387 states and 541 transitions. Second operand 3 states. [2020-07-20 18:22:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:05,974 INFO L93 Difference]: Finished difference Result 1068 states and 1577 transitions. [2020-07-20 18:22:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:05,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 18:22:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:05,979 INFO L225 Difference]: With dead ends: 1068 [2020-07-20 18:22:05,980 INFO L226 Difference]: Without dead ends: 698 [2020-07-20 18:22:05,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-07-20 18:22:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-07-20 18:22:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 674. [2020-07-20 18:22:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-07-20 18:22:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 945 transitions. [2020-07-20 18:22:06,032 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 945 transitions. Word has length 66 [2020-07-20 18:22:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:06,032 INFO L479 AbstractCegarLoop]: Abstraction has 674 states and 945 transitions. [2020-07-20 18:22:06,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 945 transitions. [2020-07-20 18:22:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-20 18:22:06,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:06,035 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:06,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:06,249 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1613085175, now seen corresponding path program 1 times [2020-07-20 18:22:06,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:06,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123076073] [2020-07-20 18:22:06,252 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:06,304 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:06,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:06,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:06,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:06,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:06,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123076073] [2020-07-20 18:22:06,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:06,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:06,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268945305] [2020-07-20 18:22:06,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:06,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:06,330 INFO L87 Difference]: Start difference. First operand 674 states and 945 transitions. Second operand 3 states. [2020-07-20 18:22:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:06,399 INFO L93 Difference]: Finished difference Result 1688 states and 2496 transitions. [2020-07-20 18:22:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:06,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-20 18:22:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:06,407 INFO L225 Difference]: With dead ends: 1688 [2020-07-20 18:22:06,407 INFO L226 Difference]: Without dead ends: 1031 [2020-07-20 18:22:06,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-07-20 18:22:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-07-20 18:22:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2020-07-20 18:22:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2020-07-20 18:22:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1460 transitions. [2020-07-20 18:22:06,479 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1460 transitions. Word has length 86 [2020-07-20 18:22:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:06,479 INFO L479 AbstractCegarLoop]: Abstraction has 1031 states and 1460 transitions. [2020-07-20 18:22:06,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1460 transitions. [2020-07-20 18:22:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-20 18:22:06,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:06,483 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:06,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:06,697 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1256301086, now seen corresponding path program 1 times [2020-07-20 18:22:06,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:06,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880022171] [2020-07-20 18:22:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:06,779 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:06,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:06,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 18:22:06,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-20 18:22:06,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:06,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1880022171] [2020-07-20 18:22:06,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:06,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:06,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720853556] [2020-07-20 18:22:06,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:06,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:06,822 INFO L87 Difference]: Start difference. First operand 1031 states and 1460 transitions. Second operand 6 states. [2020-07-20 18:22:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:06,922 INFO L93 Difference]: Finished difference Result 2065 states and 2942 transitions. [2020-07-20 18:22:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:06,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2020-07-20 18:22:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:06,931 INFO L225 Difference]: With dead ends: 2065 [2020-07-20 18:22:06,931 INFO L226 Difference]: Without dead ends: 1053 [2020-07-20 18:22:06,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2020-07-20 18:22:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1041. [2020-07-20 18:22:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2020-07-20 18:22:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1467 transitions. [2020-07-20 18:22:07,004 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1467 transitions. Word has length 147 [2020-07-20 18:22:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:07,004 INFO L479 AbstractCegarLoop]: Abstraction has 1041 states and 1467 transitions. [2020-07-20 18:22:07,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1467 transitions. [2020-07-20 18:22:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 18:22:07,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:07,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:07,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:07,222 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:07,223 INFO L82 PathProgramCache]: Analyzing trace with hash 742390854, now seen corresponding path program 1 times [2020-07-20 18:22:07,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:07,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487330999] [2020-07-20 18:22:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:07,313 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 18:22:07,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:07,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 18:22:07,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 18:22:07,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 18:22:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 18:22:07,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487330999] [2020-07-20 18:22:07,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 18:22:07,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-20 18:22:07,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402307272] [2020-07-20 18:22:07,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 18:22:07,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 18:22:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 18:22:07,460 INFO L87 Difference]: Start difference. First operand 1041 states and 1467 transitions. Second operand 4 states. [2020-07-20 18:22:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:07,610 INFO L93 Difference]: Finished difference Result 1119 states and 1601 transitions. [2020-07-20 18:22:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 18:22:07,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-07-20 18:22:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:07,618 INFO L225 Difference]: With dead ends: 1119 [2020-07-20 18:22:07,619 INFO L226 Difference]: Without dead ends: 1116 [2020-07-20 18:22:07,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 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-07-20 18:22:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-07-20 18:22:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1108. [2020-07-20 18:22:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2020-07-20 18:22:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1583 transitions. [2020-07-20 18:22:07,694 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1583 transitions. Word has length 117 [2020-07-20 18:22:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:07,695 INFO L479 AbstractCegarLoop]: Abstraction has 1108 states and 1583 transitions. [2020-07-20 18:22:07,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 18:22:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1583 transitions. [2020-07-20 18:22:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-20 18:22:07,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:07,699 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:07,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:07,913 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash 295343897, now seen corresponding path program 1 times [2020-07-20 18:22:07,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:07,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976455022] [2020-07-20 18:22:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:08,038 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:08,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:08,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 18:22:08,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-20 18:22:08,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:08,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976455022] [2020-07-20 18:22:08,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:08,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:08,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338953309] [2020-07-20 18:22:08,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:08,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:08,081 INFO L87 Difference]: Start difference. First operand 1108 states and 1583 transitions. Second operand 6 states. [2020-07-20 18:22:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:08,210 INFO L93 Difference]: Finished difference Result 2328 states and 3455 transitions. [2020-07-20 18:22:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 18:22:08,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2020-07-20 18:22:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:08,219 INFO L225 Difference]: With dead ends: 2328 [2020-07-20 18:22:08,219 INFO L226 Difference]: Without dead ends: 1239 [2020-07-20 18:22:08,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 18:22:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-07-20 18:22:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1064. [2020-07-20 18:22:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-07-20 18:22:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1442 transitions. [2020-07-20 18:22:08,292 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1442 transitions. Word has length 148 [2020-07-20 18:22:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:08,293 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1442 transitions. [2020-07-20 18:22:08,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1442 transitions. [2020-07-20 18:22:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 18:22:08,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:08,295 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:08,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:08,510 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1838874553, now seen corresponding path program 1 times [2020-07-20 18:22:08,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:08,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476821841] [2020-07-20 18:22:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:08,599 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:08,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:08,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 18:22:08,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-20 18:22:08,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:08,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476821841] [2020-07-20 18:22:08,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:08,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:08,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115690254] [2020-07-20 18:22:08,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:08,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:08,623 INFO L87 Difference]: Start difference. First operand 1064 states and 1442 transitions. Second operand 3 states. [2020-07-20 18:22:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:08,687 INFO L93 Difference]: Finished difference Result 2062 states and 2921 transitions. [2020-07-20 18:22:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:08,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-07-20 18:22:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:08,694 INFO L225 Difference]: With dead ends: 2062 [2020-07-20 18:22:08,695 INFO L226 Difference]: Without dead ends: 1064 [2020-07-20 18:22:08,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2020-07-20 18:22:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2020-07-20 18:22:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-07-20 18:22:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1434 transitions. [2020-07-20 18:22:08,770 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1434 transitions. Word has length 98 [2020-07-20 18:22:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:08,771 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1434 transitions. [2020-07-20 18:22:08,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1434 transitions. [2020-07-20 18:22:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 18:22:08,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:08,773 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:08,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:08,987 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash 697227160, now seen corresponding path program 1 times [2020-07-20 18:22:08,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:08,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675253331] [2020-07-20 18:22:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:09,083 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:09,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:09,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:09,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-20 18:22:09,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:09,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675253331] [2020-07-20 18:22:09,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:09,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:09,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195126355] [2020-07-20 18:22:09,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:09,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:09,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:09,103 INFO L87 Difference]: Start difference. First operand 1064 states and 1434 transitions. Second operand 3 states. [2020-07-20 18:22:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:09,203 INFO L93 Difference]: Finished difference Result 1883 states and 2668 transitions. [2020-07-20 18:22:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:09,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-07-20 18:22:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:09,214 INFO L225 Difference]: With dead ends: 1883 [2020-07-20 18:22:09,215 INFO L226 Difference]: Without dead ends: 885 [2020-07-20 18:22:09,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-07-20 18:22:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-07-20 18:22:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 789. [2020-07-20 18:22:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-07-20 18:22:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1018 transitions. [2020-07-20 18:22:09,273 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1018 transitions. Word has length 98 [2020-07-20 18:22:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:09,273 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 1018 transitions. [2020-07-20 18:22:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1018 transitions. [2020-07-20 18:22:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 18:22:09,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:09,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:09,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:09,491 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1565088270, now seen corresponding path program 1 times [2020-07-20 18:22:09,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:09,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314397] [2020-07-20 18:22:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:09,583 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:09,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:09,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:09,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 18:22:09,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:09,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314397] [2020-07-20 18:22:09,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:09,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:09,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286191058] [2020-07-20 18:22:09,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:09,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:09,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:09,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:09,620 INFO L87 Difference]: Start difference. First operand 789 states and 1018 transitions. Second operand 6 states. [2020-07-20 18:22:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:09,684 INFO L93 Difference]: Finished difference Result 1521 states and 2044 transitions. [2020-07-20 18:22:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:09,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-20 18:22:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:09,689 INFO L225 Difference]: With dead ends: 1521 [2020-07-20 18:22:09,689 INFO L226 Difference]: Without dead ends: 819 [2020-07-20 18:22:09,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-07-20 18:22:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-07-20 18:22:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-07-20 18:22:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1044 transitions. [2020-07-20 18:22:09,748 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1044 transitions. Word has length 99 [2020-07-20 18:22:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:09,749 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 1044 transitions. [2020-07-20 18:22:09,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1044 transitions. [2020-07-20 18:22:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 18:22:09,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:09,752 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:09,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:09,966 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1191538996, now seen corresponding path program 1 times [2020-07-20 18:22:09,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:09,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987811207] [2020-07-20 18:22:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:10,067 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:10,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:10,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 18:22:10,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:10,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987811207] [2020-07-20 18:22:10,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:10,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:10,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573359081] [2020-07-20 18:22:10,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:10,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:10,114 INFO L87 Difference]: Start difference. First operand 819 states and 1044 transitions. Second operand 6 states. [2020-07-20 18:22:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:10,188 INFO L93 Difference]: Finished difference Result 1431 states and 1880 transitions. [2020-07-20 18:22:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:10,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-20 18:22:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:10,193 INFO L225 Difference]: With dead ends: 1431 [2020-07-20 18:22:10,193 INFO L226 Difference]: Without dead ends: 703 [2020-07-20 18:22:10,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2020-07-20 18:22:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2020-07-20 18:22:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2020-07-20 18:22:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 878 transitions. [2020-07-20 18:22:10,279 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 878 transitions. Word has length 99 [2020-07-20 18:22:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:10,279 INFO L479 AbstractCegarLoop]: Abstraction has 703 states and 878 transitions. [2020-07-20 18:22:10,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 878 transitions. [2020-07-20 18:22:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 18:22:10,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:10,282 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:10,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:10,496 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-20 18:22:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:10,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [451487433] [2020-07-20 18:22:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:10,591 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:10,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:10,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 18:22:10,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:10,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 18:22:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 18:22:10,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [451487433] [2020-07-20 18:22:10,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 18:22:10,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-20 18:22:10,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037958429] [2020-07-20 18:22:10,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 18:22:10,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 18:22:10,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 18:22:10,843 INFO L87 Difference]: Start difference. First operand 703 states and 878 transitions. Second operand 12 states. [2020-07-20 18:22:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:12,397 INFO L93 Difference]: Finished difference Result 2749 states and 4111 transitions. [2020-07-20 18:22:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 18:22:12,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-20 18:22:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:12,417 INFO L225 Difference]: With dead ends: 2749 [2020-07-20 18:22:12,418 INFO L226 Difference]: Without dead ends: 2746 [2020-07-20 18:22:12,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-20 18:22:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-07-20 18:22:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2581. [2020-07-20 18:22:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2020-07-20 18:22:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3747 transitions. [2020-07-20 18:22:12,588 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3747 transitions. Word has length 99 [2020-07-20 18:22:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:12,588 INFO L479 AbstractCegarLoop]: Abstraction has 2581 states and 3747 transitions. [2020-07-20 18:22:12,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 18:22:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3747 transitions. [2020-07-20 18:22:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 18:22:12,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:12,593 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:12,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:12,804 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:12,805 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-20 18:22:12,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:12,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2005477647] [2020-07-20 18:22:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:12,926 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:12,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:12,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:12,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 18:22:12,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:12,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2005477647] [2020-07-20 18:22:12,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:12,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:12,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730193160] [2020-07-20 18:22:12,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:12,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:12,948 INFO L87 Difference]: Start difference. First operand 2581 states and 3747 transitions. Second operand 3 states. [2020-07-20 18:22:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:13,055 INFO L93 Difference]: Finished difference Result 3996 states and 6025 transitions. [2020-07-20 18:22:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:13,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-20 18:22:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:13,069 INFO L225 Difference]: With dead ends: 3996 [2020-07-20 18:22:13,070 INFO L226 Difference]: Without dead ends: 2119 [2020-07-20 18:22:13,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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-07-20 18:22:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2020-07-20 18:22:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2078. [2020-07-20 18:22:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2020-07-20 18:22:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2800 transitions. [2020-07-20 18:22:13,213 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2800 transitions. Word has length 125 [2020-07-20 18:22:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:13,214 INFO L479 AbstractCegarLoop]: Abstraction has 2078 states and 2800 transitions. [2020-07-20 18:22:13,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2800 transitions. [2020-07-20 18:22:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-07-20 18:22:13,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:13,221 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:13,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:13,436 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1259702604, now seen corresponding path program 1 times [2020-07-20 18:22:13,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:13,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282558442] [2020-07-20 18:22:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:13,494 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:13,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:13,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:13,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 18:22:13,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:13,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282558442] [2020-07-20 18:22:13,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:13,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:13,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2603983] [2020-07-20 18:22:13,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:13,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:13,518 INFO L87 Difference]: Start difference. First operand 2078 states and 2800 transitions. Second operand 3 states. [2020-07-20 18:22:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:13,591 INFO L93 Difference]: Finished difference Result 2428 states and 3246 transitions. [2020-07-20 18:22:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:13,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2020-07-20 18:22:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:13,594 INFO L225 Difference]: With dead ends: 2428 [2020-07-20 18:22:13,594 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 18:22:13,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-07-20 18:22:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 18:22:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 18:22:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 18:22:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 18:22:13,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2020-07-20 18:22:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:13,613 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 18:22:13,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 18:22:13,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 18:22:13,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:13,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 18:22:16,429 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-07-20 18:22:16,753 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-20 18:22:17,015 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2020-07-20 18:22:17,472 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-20 18:22:17,751 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-07-20 18:22:18,047 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-07-20 18:22:18,359 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2020-07-20 18:22:18,579 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-07-20 18:22:18,841 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-20 18:22:20,257 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2020-07-20 18:22:20,365 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-20 18:22:20,706 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2020-07-20 18:22:20,982 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2020-07-20 18:22:21,366 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2020-07-20 18:22:22,054 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2020-07-20 18:22:22,835 WARN L193 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2020-07-20 18:22:23,246 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2020-07-20 18:22:23,716 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2020-07-20 18:22:23,824 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-20 18:22:24,333 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-07-20 18:22:25,649 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2020-07-20 18:22:25,853 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2020-07-20 18:22:26,233 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2020-07-20 18:22:26,593 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2020-07-20 18:22:27,386 WARN L193 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2020-07-20 18:22:27,609 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-07-20 18:22:27,932 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-07-20 18:22:27,936 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 18:22:27,936 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 18:22:27,937 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 18:22:27,937 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 18:22:27,937 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse6 (not (= 1 ~q_free~0))) (.cse12 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse7 (not (<= 2 ~c_dr_st~0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse8 .cse9) (or .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse10 .cse1 .cse2 .cse3 .cse4 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse7 .cse8))) [2020-07-20 18:22:27,937 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 18:22:27,937 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 18:22:27,937 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 18:22:27,937 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (not (<= 2 ~q_write_ev~0)) (= 0 ~p_dw_st~0) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (<= 2 ~q_read_ev~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 18:22:27,938 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 18:22:27,938 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (and (<= 2 ~q_read_ev~0) (= 1 ~p_dw_i~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~q_write_ev~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 18:22:27,938 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 18:22:27,938 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 18:22:27,939 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 18:22:27,939 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 18:22:27,939 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 18:22:27,939 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse10 (= 0 ~q_free~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 2 ~q_write_ev~0))) (let ((.cse0 (and (<= 2 ~c_dr_st~0) .cse11 .cse12 .cse14)) (.cse9 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (and .cse10 .cse11 (= 1 ~p_num_write~0) .cse12 .cse13 .cse14)) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse9 .cse4 (and .cse10 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse11 .cse12 .cse13 .cse14) .cse6 .cse7 .cse8) (or .cse15 .cse2 .cse3 .cse16 .cse17 .cse4 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse4 .cse6 .cse7 .cse8) (or .cse15 .cse1 .cse2 .cse3 .cse17 .cse16 .cse4 .cse5 .cse7 .cse8)))) [2020-07-20 18:22:27,940 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (<= |old(~q_free~0)| ~q_free~0)) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse13 (= 1 ~q_free~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse16 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse14 (not (= 1 |old(~q_free~0)|))) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse4 (not (<= 2 |old(~q_write_ev~0)|))) (.cse10 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 (= ~c_num_read~0 ~p_num_write~0) .cse8 .cse9) .cse10) (or .cse11 .cse0 .cse1 .cse2 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse3 .cse4 .cse10) (or .cse11 .cse0 (and .cse5 .cse12 .cse13 .cse8 .cse9) .cse14 .cse2 .cse15 .cse3 .cse4 .cse10) (or .cse16 .cse11 .cse0 .cse14 .cse17 .cse2 .cse15 .cse4 (and .cse12 .cse18 .cse13 .cse8 .cse9) .cse10) (or (and .cse5 .cse18 .cse13 .cse8 .cse9) .cse16 .cse0 .cse14 .cse17 .cse2 .cse3 .cse4 .cse10))) [2020-07-20 18:22:27,940 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_num_write~0)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse14 (not (= 1 |old(~p_dw_pc~0)|))) (.cse13 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse8 .cse9 .cse12 .cse10 (and .cse13 .cse6) .cse11) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse14 .cse8 (and .cse13 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse15 .cse6) .cse12 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse7 .cse8 (and .cse13 .cse4 .cse5 .cse6) .cse12 .cse10 .cse11) (or .cse1 .cse2 .cse14 (and .cse13 .cse15 .cse6) .cse8 .cse12 .cse10 .cse11))) [2020-07-20 18:22:27,940 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 18:22:27,940 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 18:22:27,940 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 18:22:27,940 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (= 0 ~p_num_write~0)) (.cse14 (not (= 1 |old(~p_dw_pc~0)|))) (.cse13 (= 1 ~p_dw_pc~0)) (.cse12 (not (<= ~c_dr_pc~0 0))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 1 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse11 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 (and .cse1 .cse13 .cse3 .cse4) .cse5 .cse14 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse5 .cse6 .cse7 .cse8 .cse15 .cse10 (and .cse2 .cse3 .cse4) .cse11) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse5 .cse14 .cse8 .cse9 .cse10 (and .cse1 .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse3 .cse4) .cse11) (or .cse12 .cse5 .cse6 .cse8 .cse15 .cse9 .cse10 (and .cse1 .cse3 .cse4) .cse11))) [2020-07-20 18:22:27,941 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse18 (= 0 ~q_free~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~q_write_ev~0))) (let ((.cse8 (= 0 ~p_num_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (and .cse18 (= 1 ~p_num_write~0) .cse10 .cse11)) (.cse16 (not (= 1 |old(~p_dw_pc~0)|))) (.cse15 (= 1 ~p_dw_pc~0)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (<= 2 ~c_dr_st~0)) (.cse13 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or (and .cse14 .cse15 .cse10 .cse11) .cse1 .cse2 .cse16 .cse5 .cse17 .cse7 .cse13) (or (and .cse14 .cse8 .cse9 .cse10 .cse11) .cse0 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse12 .cse13) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse16 .cse5 (and .cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse15 .cse10 .cse11) .cse17 .cse7 .cse13) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 (and .cse14 .cse10 .cse11) .cse13)))) [2020-07-20 18:22:27,941 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 18:22:27,941 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 18:22:27,941 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 18:22:27,941 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 18:22:27,941 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 18:22:27,941 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse5 (not (= 0 ~q_free~0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse4 .cse5 .cse6) (or (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (or .cse0 .cse2 (not (<= 2 |old(~p_dw_st~0)|)) .cse3 (not (<= 2 ~q_write_ev~0)) (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse1 (not (<= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse6))) [2020-07-20 18:22:27,942 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 18:22:27,942 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 18:22:27,942 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 18:22:27,942 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 18:22:27,943 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 18:22:27,944 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse5 (not (= 0 ~q_free~0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse4 .cse5 .cse6) (or (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (or .cse0 .cse2 (not (<= 2 |old(~p_dw_st~0)|)) .cse3 (not (<= 2 ~q_write_ev~0)) (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse1 (not (<= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse6))) [2020-07-20 18:22:27,944 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse3 (= 0 immediate_notify_threads_~tmp~0))) (let ((.cse4 (not (= 0 ~c_num_read~0))) (.cse10 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse5 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (and (<= 2 ~c_dr_st~0) .cse3)) (.cse8 (not (= 0 ~q_free~0))) (.cse9 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (<= 2 |old(~p_dw_st~0)|)) .cse2 (not (<= 2 ~q_write_ev~0)) (not (= ~c_num_read~0 ~p_num_write~0)) (= 0 ~p_dw_st~0) (and (<= 2 ~p_dw_st~0) .cse3) (not (= 1 ~q_free~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse4 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 .cse2 .cse5 .cse6 .cse9) (or .cse4 .cse10 .cse1 .cse2 .cse7 .cse8 .cse3 .cse9) (or .cse0 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse5 .cse6 .cse8 .cse9)))) [2020-07-20 18:22:27,944 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 18:22:27,944 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:22:27,944 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= ~c_num_read~0 ~p_num_write~0)) (<= |old(~q_free~0)| ~q_free~0)) [2020-07-20 18:22:27,945 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:22:27,945 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse18 (not (= 0 |old(~p_dw_st~0)|))) (.cse19 (not (= 1 |old(~q_free~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 0 ~p_dw_st~0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse15 (= 1 ~q_free~0)) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse12 (<= 2 ~q_read_ev~0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse26 (<= |old(~q_free~0)| ~q_free~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~p_dw_st~0)) (.cse17 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse24 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse20 (not (<= 2 |old(~c_dr_st~0)|))) (.cse25 (= 1 ~p_num_write~0)) (.cse9 (not (<= 2 |old(~q_write_ev~0)|))) (.cse10 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (and .cse11 .cse12 .cse13 .cse14 .cse8 .cse15 .cse16 .cse17) .cse0 .cse18 .cse19 .cse5 .cse7 .cse20 .cse9 .cse10 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse12 .cse22 .cse16 .cse23 .cse17) .cse9 .cse10 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse9 .cse10) (or .cse0 .cse1 .cse5 .cse7 (and .cse11 .cse12 .cse22 .cse26 .cse8 .cse16 .cse17) .cse20 .cse9 .cse10) (or .cse0 .cse1 .cse18 .cse5 .cse7 .cse14 .cse20 .cse9 .cse10) (or .cse0 .cse18 .cse19 (not (= 0 |old(~p_num_write~0)|)) .cse5 .cse6 .cse7 (and .cse12 (= 0 ~c_num_read~0) .cse13 .cse14 .cse8 (= 0 ~p_num_write~0) .cse16 .cse15 .cse17) .cse9 .cse10 .cse21) (or .cse0 .cse1 .cse3 .cse5 (and .cse11 .cse12 .cse22 .cse26 (= ~c_num_read~0 ~p_num_write~0) .cse16 .cse23 .cse17) (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse20 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse4 .cse5 .cse20 .cse9 .cse10 .cse24) (or .cse0 .cse2 .cse1 .cse3 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse20 .cse25 .cse9 .cse10))) [2020-07-20 18:22:27,946 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse14 (<= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~c_dr_st~0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse25 (= 1 ~p_dw_i~0)) (.cse26 (= 1 ~p_dw_pc~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= 2 ~q_write_ev~0))) (let ((.cse5 (and .cse20 .cse10 .cse25 .cse26 (= ~c_num_read~0 ~p_num_write~0) .cse17 .cse18)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= 1 eval_~tmp___1~0)) (.cse16 (= 1 ~q_free~0)) (.cse9 (not (= 0 |old(~p_dw_st~0)|))) (.cse19 (not (= 1 |old(~q_free~0)|))) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse21 (not (<= |old(~c_dr_pc~0)| 0))) (.cse23 (and .cse20 .cse10 .cse25 .cse26 .cse14 .cse17 .cse18)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse4 (not .cse25)) (.cse24 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (not (<= 2 |old(~q_write_ev~0)|))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|))) (.cse8 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (= 0 ~c_num_read~0)) (.cse15 (= 0 ~p_num_write~0))) (or .cse0 .cse9 (not (= 0 |old(~p_num_write~0)|)) .cse6 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse4 (and .cse20 .cse10 .cse11 .cse15 .cse16 .cse17 .cse18) (not (= 0 |old(~c_num_read~0)|)) .cse21 .cse5 .cse7 .cse22)) (or .cse0 (and .cse20 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18) .cse9 .cse19 .cse4 .cse21 .cse23 .cse24 .cse6 .cse7 .cse22) (or .cse0 .cse1 .cse4 .cse21 .cse23 .cse24 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse24 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse6 .cse7 .cse8)))) [2020-07-20 18:22:27,946 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 18:22:27,946 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 18:22:27,946 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 18:22:27,946 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse25 (<= ~c_dr_pc~0 0)) (.cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse13 (<= 2 ~q_read_ev~0)) (.cse33 (= 1 ~p_dw_i~0)) (.cse14 (= 1 ~p_dw_pc~0)) (.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse18 (<= 2 ~q_write_ev~0))) (let ((.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse12 (and .cse5 .cse13 .cse33 .cse14 .cse16 .cse17 .cse32 .cse18)) (.cse11 (and (= 0 ~q_free~0) .cse6 .cse13 .cse14 .cse33 .cse17 .cse32 .cse18)) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse26 (not (= 0 |old(~c_num_read~0)|))) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse23 (= 1 ~q_free~0)) (.cse19 (not (= 0 |old(~p_dw_st~0)|))) (.cse24 (not (= 1 |old(~q_free~0)|))) (.cse27 (not (<= |old(~c_dr_pc~0)| 0))) (.cse29 (and .cse5 .cse13 .cse33 .cse14 .cse25 .cse17 .cse18)) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse30 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not .cse33)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse31 (= 1 ~p_num_write~0)) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 (and .cse5 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse9 .cse10) (let ((.cse20 (= 0 ~c_num_read~0)) (.cse22 (= 0 ~p_num_write~0))) (or .cse0 .cse19 (not (= 0 |old(~p_num_write~0)|)) (and .cse5 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18) .cse12 (and .cse5 .cse13 .cse20 .cse21 .cse15 .cse22 .cse23 .cse17 .cse18) .cse8 .cse24 (and .cse13 .cse21 .cse20 .cse15 .cse25 .cse22 .cse23 .cse17 .cse18) .cse4 .cse11 .cse26 .cse27 .cse9 .cse28)) (or .cse0 .cse1 .cse4 .cse27 .cse29 .cse7 .cse8 .cse9) (or .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse26 .cse7 .cse31 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (and .cse5 .cse13 .cse14 (<= |old(~q_free~0)| ~q_free~0) .cse16 .cse17 .cse32 .cse18) (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse7 .cse8 .cse9) (or (and .cse5 .cse13 .cse21 .cse15 .cse25 .cse23 .cse17 .cse18) .cse0 .cse19 .cse24 .cse4 .cse27 .cse29 .cse7 .cse8 .cse9 .cse28) (or .cse0 .cse30 .cse1 .cse2 .cse4 (not (= 1 |old(~c_num_read~0)|)) .cse7 .cse31 .cse8 .cse9)))) [2020-07-20 18:22:27,947 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse13 (<= 2 ~q_read_ev~0)) (.cse17 (= 1 ~p_dw_i~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0))) (let ((.cse9 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse13 (= 1 ~p_dw_pc~0) .cse17 .cse14 (<= 2 ~p_dw_st~0) .cse15)) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse12 (not (= 1 |old(~q_free~0)|))) (.cse2 (not .cse17)) (.cse3 (not (<= |old(~c_dr_pc~0)| 0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse5 (not (<= 2 |old(~q_write_ev~0)|))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|))) (.cse16 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse5 .cse6 .cse10) (or .cse0 .cse11 .cse12 (not (= 0 |old(~p_num_write~0)|)) .cse2 .cse9 (not (= 0 |old(~c_num_read~0)|)) .cse3 (and .cse13 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= 1 eval_~tmp___1~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) .cse14 .cse15) .cse5 .cse6 .cse16) (or .cse0 .cse1 .cse7 .cse2 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16)))) [2020-07-20 18:22:27,947 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 18:22:27,947 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 18:22:27,947 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 18:22:27,948 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse16 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse27 (= 1 ~p_dw_i~0)) (.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (<= 2 ~p_dw_st~0)) (.cse26 (<= 2 ~q_write_ev~0))) (let ((.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (not (= 0 |old(~q_free~0)|))) (.cse10 (and (= 0 ~q_free~0) .cse17 .cse21 .cse22 .cse27 .cse24 .cse25 .cse26)) (.cse12 (and .cse16 .cse21 .cse22 .cse27 .cse23 .cse24 .cse25 .cse26)) (.cse18 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse4 (not (<= |old(~c_dr_pc~0)| 0))) (.cse7 (and .cse16 .cse21 .cse22 (<= ~c_dr_pc~0 0) .cse24 .cse26)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse13 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not .cse27)) (.cse5 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0)) (.cse6 (not (<= 2 |old(~q_write_ev~0)|))) (.cse8 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= 0 |old(~p_num_write~0)|)) .cse3 .cse10 .cse11 .cse12 .cse4 .cse6 .cse8 .cse9) (or .cse0 .cse13 .cse14 .cse15 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse16 .cse17) .cse5 .cse6 .cse8 .cse18) (or .cse0 .cse19 .cse13 .cse14 .cse15 .cse3 .cse11 .cse5 .cse20 .cse6 .cse8) (or .cse0 .cse13 .cse14 .cse3 (and .cse16 .cse21 .cse22 (<= |old(~q_free~0)| ~q_free~0) .cse23 .cse24 .cse25 .cse26) (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse5 .cse6 .cse8) (or .cse0 .cse13 .cse14 .cse15 .cse3 .cse10 .cse12 .cse6 .cse8 .cse18) (or .cse0 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse19 .cse13 .cse14 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse5 .cse20 .cse6 .cse8)))) [2020-07-20 18:22:27,948 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 18:22:27,948 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse25 (<= ~c_dr_pc~0 0)) (.cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse13 (<= 2 ~q_read_ev~0)) (.cse33 (= 1 ~p_dw_i~0)) (.cse14 (= 1 ~p_dw_pc~0)) (.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse18 (<= 2 ~q_write_ev~0))) (let ((.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse12 (and .cse5 .cse13 .cse33 .cse14 .cse16 .cse17 .cse32 .cse18)) (.cse11 (and (= 0 ~q_free~0) .cse6 .cse13 .cse14 .cse33 .cse17 .cse32 .cse18)) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse26 (not (= 0 |old(~c_num_read~0)|))) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse23 (= 1 ~q_free~0)) (.cse19 (not (= 0 |old(~p_dw_st~0)|))) (.cse24 (not (= 1 |old(~q_free~0)|))) (.cse27 (not (<= |old(~c_dr_pc~0)| 0))) (.cse29 (and .cse5 .cse13 .cse33 .cse14 .cse25 .cse17 .cse18)) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse30 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not .cse33)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse31 (= 1 ~p_num_write~0)) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 (and .cse5 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse9 .cse10) (let ((.cse20 (= 0 ~c_num_read~0)) (.cse22 (= 0 ~p_num_write~0))) (or .cse0 .cse19 (not (= 0 |old(~p_num_write~0)|)) (and .cse5 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18) .cse12 (and .cse5 .cse13 .cse20 .cse21 .cse15 .cse22 .cse23 .cse17 .cse18) .cse8 .cse24 (and .cse13 .cse21 .cse20 .cse15 .cse25 .cse22 .cse23 .cse17 .cse18) .cse4 .cse11 .cse26 .cse27 .cse9 .cse28)) (or .cse0 .cse1 .cse4 .cse27 .cse29 .cse7 .cse8 .cse9) (or .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse26 .cse7 .cse31 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (and .cse5 .cse13 .cse14 (<= |old(~q_free~0)| ~q_free~0) .cse16 .cse17 .cse32 .cse18) (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse7 .cse8 .cse9) (or (and .cse5 .cse13 .cse21 .cse15 .cse25 .cse23 .cse17 .cse18) .cse0 .cse19 .cse24 .cse4 .cse27 .cse29 .cse7 .cse8 .cse9 .cse28) (or .cse0 .cse30 .cse1 .cse2 .cse4 (not (= 1 |old(~c_num_read~0)|)) .cse7 .cse31 .cse8 .cse9)))) [2020-07-20 18:22:27,948 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 18:22:27,948 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 18:22:27,948 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 18:22:27,949 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 18:22:27,949 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 18:22:27,949 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 18:22:27,949 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 18:22:27,949 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse8 (not (<= ~c_dr_pc~0 0))) (.cse9 (not (<= 2 ~q_read_ev~0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not (= 0 ~p_dw_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= 0 ~c_num_read~0)) .cse8 .cse1 .cse2 (not (= 1 ~p_num_write~0)) .cse6 (not (= 0 ~q_free~0)) .cse9) (or .cse8 .cse1 .cse2 .cse6 (not (<= 2 ~c_dr_st~0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~p_dw_st~0)) .cse7))) [2020-07-20 18:22:27,950 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 18:22:27,950 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 18:22:27,950 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 18:22:27,950 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 18:22:27,950 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 18:22:27,950 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 18:22:27,952 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= 2 ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0) (<= 2 ~q_write_ev~0)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 18:22:27,952 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 18:22:27,952 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 18:22:27,952 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse5 (= 1 ~q_free~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (<= 2 ~q_read_ev~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse8 .cse6 .cse9 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (and .cse1 (= 0 ~c_num_read~0) .cse2 .cse3 .cse4 (= 0 ~p_num_write~0) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse6 .cse7) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse0 .cse1 .cse8 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse9 .cse7) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 18:22:27,953 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse5 (<= 2 ~c_dr_st~0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse1 (= 1 ~p_dw_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse4 (<= 2 ~q_write_ev~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= 2 |old(~q_write_ev~0)|)) (and .cse5 .cse0 .cse1 (<= ~c_dr_pc~0 0) .cse2 .cse4) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse5 .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 18:22:27,953 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 18:22:27,953 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 18:22:27,953 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse5 (= 1 ~q_free~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (<= 2 ~q_read_ev~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse8 .cse6 .cse9 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (and .cse1 (= 0 ~c_num_read~0) .cse2 .cse3 .cse4 (= 0 ~p_num_write~0) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse6 .cse7) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse0 .cse1 .cse8 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse9 .cse7) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 18:22:27,953 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= 2 ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0) (<= 2 ~q_write_ev~0)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 18:22:27,953 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 18:22:27,954 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:22:27,954 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-20 18:22:27,954 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 18:22:27,955 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse4 (not (<= 2 ~c_dr_st~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse3 (not (= 0 ~q_free~0))) (.cse5 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= 1 ~p_dw_pc~0)) .cse0 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (or .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (or .cse6 .cse8 .cse0 .cse1 .cse2 .cse7 .cse3 .cse5))) [2020-07-20 18:22:27,955 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 18:22:27,956 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 18:22:27,956 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 0 ~p_dw_st~0)) (.cse5 (= 1 ~q_free~0)) (.cse9 (not (<= 2 |old(~q_read_ev~0)|)))) (and (let ((.cse4 (= ~c_num_read~0 ~p_num_write~0))) (or (not (= 1 ~p_dw_pc~0)) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~p_dw_st~0)) (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse6 .cse7 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) .cse9)) (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse6 .cse7 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (and .cse1 .cse2 (= 0 ~c_num_read~0) .cse3 .cse8 .cse5) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) .cse9 (not (= 0 ~p_num_write~0))))) [2020-07-20 18:22:27,956 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 18:22:27,956 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) .cse3 (not (= 0 ~p_num_write~0))) (or (not (= 1 ~p_dw_pc~0)) .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse3))) [2020-07-20 18:22:27,957 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_read_ev~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= 0 ~p_dw_st~0)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= |old(~c_dr_pc~0)| 0))) (.cse10 (= 1 ~q_free~0)) (.cse12 (not (<= 2 |old(~q_read_ev~0)|)))) (and (let ((.cse5 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5) .cse6 .cse7 (and .cse4 .cse8 .cse9 .cse10 .cse5) (and .cse4 .cse8 .cse11 .cse9 .cse10) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse12)) (or .cse1 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse6 .cse7 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse13 .cse14 (and .cse4 (= 0 ~c_num_read~0) .cse8 .cse11 .cse10) .cse12 (not (= 0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13 .cse14 (<= ~c_dr_pc~0 0) (not (= 1 ~p_num_write~0)) .cse10 .cse12))) [2020-07-20 18:22:27,957 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (<= |old(~c_dr_pc~0)| 0))) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse6 .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5) (or .cse6 .cse0 .cse7 .cse8 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~q_read_ev~0) (<= 2 ~p_dw_st~0)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse5))) [2020-07-20 18:22:27,957 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 18:22:27,957 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 18:22:27,957 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (<= ~c_dr_pc~0 0)) (.cse8 (not (= 1 ~p_dw_pc~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse1 (<= 2 ~q_read_ev~0)) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and .cse1 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse2 (= 1 ~q_free~0)) .cse3 .cse4 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse5 .cse6 .cse7 (not (= 0 ~p_num_write~0))) (or .cse8 .cse0 .cse9 .cse10 .cse3 .cse4 .cse5 .cse6 .cse2 (not (= 1 ~p_num_write~0)) .cse7) (or .cse8 .cse0 .cse9 .cse10 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 (<= 2 ~p_dw_st~0)) .cse3 .cse4 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse7))) [2020-07-20 18:22:27,957 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 18:22:27,958 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) .cse3 (not (= 0 ~p_num_write~0))) (or (not (= 1 ~p_dw_pc~0)) .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse3))) [2020-07-20 18:22:27,958 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 18:22:27,958 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 18:22:27,959 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse6 (not (= 1 ~p_dw_pc~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (<= |old(~c_dr_pc~0)| 0))) (.cse5 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse6 .cse0 .cse7 .cse8 .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse5 (and (= ~c_last_read~0 ~p_last_write~0) (= ~c_num_read~0 ~p_num_write~0) (= 1 ~q_free~0) (<= 2 ~p_dw_st~0))) (or .cse6 .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 (<= ~c_dr_pc~0 0) (not (= 1 ~p_num_write~0)) .cse5))) [2020-07-20 18:22:27,959 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 18:22:27,959 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 18:22:27,959 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 18:22:27,959 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (= 0 ~c_num_read~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 18:22:28,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:22:28 BoogieIcfgContainer [2020-07-20 18:22:28,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 18:22:28,044 INFO L168 Benchmark]: Toolchain (without parser) took 26420.68 ms. Allocated memory was 142.1 MB in the beginning and 528.0 MB in the end (delta: 385.9 MB). Free memory was 103.2 MB in the beginning and 134.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 405.7 MB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,045 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.1 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.89 ms. Allocated memory is still 142.1 MB. Free memory was 102.8 MB in the beginning and 90.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,050 INFO L168 Benchmark]: Boogie Preprocessor took 133.33 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 90.5 MB in the beginning and 179.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,051 INFO L168 Benchmark]: RCFGBuilder took 481.97 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 152.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,051 INFO L168 Benchmark]: TraceAbstraction took 25454.37 ms. Allocated memory was 202.4 MB in the beginning and 528.0 MB in the end (delta: 325.6 MB). Free memory was 152.4 MB in the beginning and 134.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 394.6 MB. Max. memory is 7.1 GB. [2020-07-20 18:22:28,055 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.24 ms. Allocated memory is still 142.1 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.89 ms. Allocated memory is still 142.1 MB. Free memory was 102.8 MB in the beginning and 90.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.33 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 90.5 MB in the beginning and 179.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.97 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 152.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25454.37 ms. Allocated memory was 202.4 MB in the beginning and 528.0 MB in the end (delta: 325.6 MB). Free memory was 152.4 MB in the beginning and 134.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 394.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || (((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || (((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(0 == \old(c_num_read))) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && \old(q_free) <= q_free) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || (((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || (((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_read_ev)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_last_write == q_buf_0) || !(1 == \old(q_free))) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(q_read_ev))) || !(0 == p_num_write)) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) || !(2 <= \old(q_read_ev)))) && ((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_num_write == \old(c_num_read) + 1)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(q_write_ev))) || ((((c_last_read == p_last_write && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev)) && ((((((((((2 <= c_dr_st && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && (((((((((((((2 <= c_dr_st && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && ((((((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || ((2 <= c_dr_st && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((2 <= q_read_ev && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || ((((2 <= q_read_ev && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) || !(p_num_write == \old(c_num_read) + 1)) || !(2 <= \old(q_read_ev))) && ((((((((((!(p_last_write == q_buf_0) || !(1 == \old(q_free))) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((2 <= q_read_ev && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(q_read_ev))) || !(0 == p_num_write))) && (((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || c_dr_pc <= 0) || !(1 == p_num_write)) || 1 == q_free) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(c_num_read + 1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) || !(2 <= q_read_ev)) && (((((((!(0 == c_num_read) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && (((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(2 <= q_read_ev)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || ((((((((2 <= q_read_ev && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || (((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_i) && 1 == p_dw_pc) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && 0 == p_dw_st) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_num_read == p_num_write) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_i) && 1 == p_dw_pc) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((((((2 <= c_dr_st && 2 <= q_read_ev) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= q_read_ev && c_last_read == p_last_write) && 0 == c_num_read) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || (((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_pc) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || (((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && \old(q_free) <= q_free) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev)))) && (((((((((((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_dr_st && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev)) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || (((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && ((((((((((2 <= c_dr_st && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && (((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(c_last_read == p_last_write)) && (((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || 0 == __retres1) || !(0 == q_free)) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && ((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || (((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_num_write == \old(c_num_read) + 1)) || (((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(q_read_ev))) && ((((((((((!(p_last_write == q_buf_0) || !(1 == \old(q_free))) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || (((((2 <= c_dr_st && 2 <= q_read_ev) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(q_read_ev))) || !(0 == p_num_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(1 == q_free)) || !(2 <= c_dr_st)) || !(2 <= q_read_ev)) || !(c_last_read == p_last_write)) && ((((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && ((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(1 == q_free)) || !(0 == p_num_write)) || !(2 <= q_read_ev)) || !(c_last_read == p_last_write))) && ((((((((((!(0 == c_num_read) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(1 == q_free)) || !(2 <= c_dr_st)) || !(0 == p_num_write)) || !(2 <= q_read_ev)) || !(c_last_read == p_last_write))) && ((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || 1 <= __retres1) || !(2 <= c_dr_st)) || !(2 <= q_read_ev)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(0 == c_num_read) || (((2 <= c_dr_st && 0 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev)) && (((((((!(c_dr_pc <= 0) || (((2 <= c_dr_st && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(2 <= q_read_ev))) && (((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(q_write_ev))) || ((0 == p_num_write && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || ((((2 <= c_dr_st && 1 == p_dw_pc) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev))) && ((((((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || ((2 <= c_dr_st && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= q_read_ev)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.1s, OverallIterations: 17, TraceHistogramMax: 4, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2720 SDtfs, 2600 SDslu, 3296 SDs, 0 SdLazy, 1329 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1879 GetRequests, 1820 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2581occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 602 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4862 PreInvPairs, 5218 NumberOfFragments, 6715 HoareAnnotationTreeSize, 4862 FomulaSimplifications, 17611 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 18535 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1660 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 319211 SizeOfPredicates, 32 NumberOfNonLiveVariables, 7467 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 484/528 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 correct! Received shutdown request...