/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_FUNCTIONS --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/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 14:59:16,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 14:59:16,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 14:59:16,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 14:59:16,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 14:59:16,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 14:59:16,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 14:59:16,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 14:59:16,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 14:59:16,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 14:59:16,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 14:59:16,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 14:59:16,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 14:59:16,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 14:59:16,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 14:59:16,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 14:59:16,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 14:59:16,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 14:59:16,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 14:59:16,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 14:59:16,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 14:59:16,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 14:59:16,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 14:59:16,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 14:59:16,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 14:59:16,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 14:59:16,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 14:59:16,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 14:59:16,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 14:59:16,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 14:59:16,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 14:59:16,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 14:59:16,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 14:59:16,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 14:59:16,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 14:59:16,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 14:59:16,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 14:59:16,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 14:59:16,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 14:59:16,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 14:59:16,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 14:59:16,525 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 14:59:16,562 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 14:59:16,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 14:59:16,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 14:59:16,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 14:59:16,566 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 14:59:16,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 14:59:16,568 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 14:59:16,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 14:59:16,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 14:59:16,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 14:59:16,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 14:59:16,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 14:59:16,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 14:59:16,570 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 14:59:16,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 14:59:16,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 14:59:16,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 14:59:16,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 14:59:16,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 14:59:16,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 14:59:16,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 14:59:16,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 14:59:16,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 14:59:16,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 14:59:16,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 14:59:16,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 14:59:16,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:16,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 14:59:16,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 14:59:16,574 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_FUNCTIONS 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 14:59:16,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 14:59:16,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 14:59:16,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 14:59:16,940 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 14:59:16,940 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 14:59:16,941 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 14:59:17,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f134836d/8c21d494459c4f81bc1f89ba76c737a4/FLAG8ce2b96fa [2020-07-20 14:59:17,527 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 14:59:17,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 14:59:17,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f134836d/8c21d494459c4f81bc1f89ba76c737a4/FLAG8ce2b96fa [2020-07-20 14:59:17,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f134836d/8c21d494459c4f81bc1f89ba76c737a4 [2020-07-20 14:59:17,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 14:59:17,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 14:59:17,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 14:59:17,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 14:59:17,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 14:59:17,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:59:17" (1/1) ... [2020-07-20 14:59:17,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea3c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:17, skipping insertion in model container [2020-07-20 14:59:17,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:59:17" (1/1) ... [2020-07-20 14:59:17,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 14:59:17,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 14:59:18,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:59:18,218 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 14:59:18,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:59:18,363 INFO L208 MainTranslator]: Completed translation [2020-07-20 14:59:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18 WrapperNode [2020-07-20 14:59:18,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 14:59:18,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 14:59:18,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 14:59:18,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 14:59:18,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (1/1) ... [2020-07-20 14:59:18,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 14:59:18,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 14:59:18,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 14:59:18,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 14:59:18,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (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 14:59:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 14:59:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 14:59:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 14:59:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 14:59:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 14:59:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 14:59:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 14:59:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 14:59:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 14:59:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 14:59:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 14:59:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 14:59:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 14:59:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 14:59:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 14:59:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 14:59:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 14:59:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 14:59:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 14:59:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 14:59:18,973 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 14:59:18,974 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 14:59:18,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:59:18 BoogieIcfgContainer [2020-07-20 14:59:18,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 14:59:18,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 14:59:18,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 14:59:18,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 14:59:18,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:59:17" (1/3) ... [2020-07-20 14:59:18,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0a5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:59:18, skipping insertion in model container [2020-07-20 14:59:18,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:59:18" (2/3) ... [2020-07-20 14:59:18,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0a5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:59:18, skipping insertion in model container [2020-07-20 14:59:18,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:59:18" (3/3) ... [2020-07-20 14:59:18,989 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-20 14:59:19,001 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 14:59:19,010 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 14:59:19,026 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 14:59:19,056 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 14:59:19,056 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 14:59:19,056 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 14:59:19,057 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 14:59:19,057 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 14:59:19,057 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 14:59:19,057 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 14:59:19,058 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 14:59:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-20 14:59:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:19,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:19,101 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:19,101 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-20 14:59:19,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:19,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7662184] [2020-07-20 14:59:19,121 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 14:59:19,348 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:19,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:19,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 14:59:19,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:19,455 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 14:59:19,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:19,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7662184] [2020-07-20 14:59:19,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:19,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:19,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628053067] [2020-07-20 14:59:19,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:19,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:19,484 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-20 14:59:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:19,597 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-20 14:59:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:19,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 14:59:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:19,618 INFO L225 Difference]: With dead ends: 381 [2020-07-20 14:59:19,619 INFO L226 Difference]: Without dead ends: 243 [2020-07-20 14:59:19,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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 14:59:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-20 14:59:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-20 14:59:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-20 14:59:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-20 14:59:19,713 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-20 14:59:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:19,714 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-20 14:59:19,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-20 14:59:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:19,719 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:19,719 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:19,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:19,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-20 14:59:19,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:19,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1046821213] [2020-07-20 14:59:19,938 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 14:59:20,058 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:20,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:20,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:59:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:20,113 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 14:59:20,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:20,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1046821213] [2020-07-20 14:59:20,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:20,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:59:20,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915139388] [2020-07-20 14:59:20,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:59:20,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:59:20,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:59:20,121 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-20 14:59:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:20,654 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-20 14:59:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 14:59:20,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 14:59:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:20,661 INFO L225 Difference]: With dead ends: 565 [2020-07-20 14:59:20,661 INFO L226 Difference]: Without dead ends: 346 [2020-07-20 14:59:20,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:59:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-20 14:59:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-20 14:59:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-20 14:59:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-20 14:59:20,715 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-20 14:59:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:20,716 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-20 14:59:20,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:59:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-20 14:59:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:20,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:20,719 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:20,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:20,933 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-20 14:59:20,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:20,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145785382] [2020-07-20 14:59:20,935 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 14:59:21,026 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:21,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:21,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:59:21,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:21,080 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 14:59:21,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:21,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145785382] [2020-07-20 14:59:21,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:21,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:59:21,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096515886] [2020-07-20 14:59:21,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:59:21,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:21,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:59:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:59:21,087 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-20 14:59:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:21,749 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-20 14:59:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:59:21,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 14:59:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:21,755 INFO L225 Difference]: With dead ends: 850 [2020-07-20 14:59:21,756 INFO L226 Difference]: Without dead ends: 583 [2020-07-20 14:59:21,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:59:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-20 14:59:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-20 14:59:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 14:59:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-20 14:59:21,815 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-20 14:59:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:21,817 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-20 14:59:21,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:59:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-20 14:59:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:21,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:21,822 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:22,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:22,040 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-20 14:59:22,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:22,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552753506] [2020-07-20 14:59:22,043 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 14:59:22,113 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:22,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:22,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:59:22,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:22,153 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 14:59:22,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:22,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552753506] [2020-07-20 14:59:22,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:22,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:59:22,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659591409] [2020-07-20 14:59:22,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:59:22,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:59:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:59:22,156 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-20 14:59:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:22,534 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-20 14:59:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 14:59:22,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 14:59:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:22,542 INFO L225 Difference]: With dead ends: 1049 [2020-07-20 14:59:22,543 INFO L226 Difference]: Without dead ends: 534 [2020-07-20 14:59:22,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:59:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-20 14:59:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-20 14:59:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 14:59:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-20 14:59:22,607 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-20 14:59:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:22,608 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-20 14:59:22,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:59:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-20 14:59:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:22,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:22,613 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:22,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:22,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-20 14:59:22,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:22,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760057139] [2020-07-20 14:59:22,831 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 14:59:22,908 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:22,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:22,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 14:59:22,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:22,966 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 14:59:22,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:22,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760057139] [2020-07-20 14:59:22,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 14:59:22,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720182714] [2020-07-20 14:59:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:59:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:59:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:59:22,971 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 6 states. [2020-07-20 14:59:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:23,048 INFO L93 Difference]: Finished difference Result 1062 states and 1356 transitions. [2020-07-20 14:59:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:59:23,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 14:59:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:23,054 INFO L225 Difference]: With dead ends: 1062 [2020-07-20 14:59:23,054 INFO L226 Difference]: Without dead ends: 548 [2020-07-20 14:59:23,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 14:59:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-07-20 14:59:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2020-07-20 14:59:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-20 14:59:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 671 transitions. [2020-07-20 14:59:23,122 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 671 transitions. Word has length 77 [2020-07-20 14:59:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:23,122 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 671 transitions. [2020-07-20 14:59:23,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:59:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 671 transitions. [2020-07-20 14:59:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:23,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:23,124 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:23,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:23,338 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1460126479, now seen corresponding path program 1 times [2020-07-20 14:59:23,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:23,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374826459] [2020-07-20 14:59:23,341 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 14:59:23,412 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:59:23,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:23,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 14:59:23,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:23,474 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 14:59:23,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:23,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374826459] [2020-07-20 14:59:23,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:23,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 14:59:23,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26179516] [2020-07-20 14:59:23,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:59:23,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:59:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:59:23,478 INFO L87 Difference]: Start difference. First operand 544 states and 671 transitions. Second operand 6 states. [2020-07-20 14:59:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:23,541 INFO L93 Difference]: Finished difference Result 1152 states and 1457 transitions. [2020-07-20 14:59:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:59:23,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 14:59:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:23,547 INFO L225 Difference]: With dead ends: 1152 [2020-07-20 14:59:23,547 INFO L226 Difference]: Without dead ends: 628 [2020-07-20 14:59:23,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 14:59:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-07-20 14:59:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2020-07-20 14:59:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-20 14:59:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 711 transitions. [2020-07-20 14:59:23,599 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 711 transitions. Word has length 77 [2020-07-20 14:59:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:23,601 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 711 transitions. [2020-07-20 14:59:23,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:59:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 711 transitions. [2020-07-20 14:59:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:23,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:23,602 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:23,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:23,818 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-20 14:59:23,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:23,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1754532436] [2020-07-20 14:59:23,819 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 14:59:23,896 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:59:23,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:23,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 14:59:23,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:23,939 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 14:59:23,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:23,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1754532436] [2020-07-20 14:59:23,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:23,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:59:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108868395] [2020-07-20 14:59:23,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:59:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:59:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:59:23,942 INFO L87 Difference]: Start difference. First operand 584 states and 711 transitions. Second operand 5 states. [2020-07-20 14:59:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:24,439 INFO L93 Difference]: Finished difference Result 1258 states and 1614 transitions. [2020-07-20 14:59:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:59:24,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 14:59:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:24,446 INFO L225 Difference]: With dead ends: 1258 [2020-07-20 14:59:24,446 INFO L226 Difference]: Without dead ends: 693 [2020-07-20 14:59:24,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:59:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-20 14:59:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 608. [2020-07-20 14:59:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-07-20 14:59:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 713 transitions. [2020-07-20 14:59:24,502 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 713 transitions. Word has length 77 [2020-07-20 14:59:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:24,502 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 713 transitions. [2020-07-20 14:59:24,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:59:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 713 transitions. [2020-07-20 14:59:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 14:59:24,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:24,504 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, 1, 1, 1, 1, 1] [2020-07-20 14:59:24,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:24,719 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-20 14:59:24,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:24,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725053471] [2020-07-20 14:59:24,722 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 14:59:24,812 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:59:24,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:24,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 14:59:24,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:24,843 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 14:59:24,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:24,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725053471] [2020-07-20 14:59:24,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:24,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:24,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530761161] [2020-07-20 14:59:24,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:24,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:24,846 INFO L87 Difference]: Start difference. First operand 608 states and 713 transitions. Second operand 3 states. [2020-07-20 14:59:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:24,925 INFO L93 Difference]: Finished difference Result 1748 states and 2108 transitions. [2020-07-20 14:59:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:24,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 14:59:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:24,933 INFO L225 Difference]: With dead ends: 1748 [2020-07-20 14:59:24,933 INFO L226 Difference]: Without dead ends: 1160 [2020-07-20 14:59:24,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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 14:59:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-07-20 14:59:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2020-07-20 14:59:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-07-20 14:59:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1349 transitions. [2020-07-20 14:59:25,011 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1349 transitions. Word has length 77 [2020-07-20 14:59:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:25,012 INFO L479 AbstractCegarLoop]: Abstraction has 1156 states and 1349 transitions. [2020-07-20 14:59:25,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1349 transitions. [2020-07-20 14:59:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-20 14:59:25,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:25,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:25,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:25,229 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2020-07-20 14:59:25,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:25,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440780282] [2020-07-20 14:59:25,232 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 14:59:25,283 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:59:25,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:25,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 14:59:25,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 14:59:25,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:25,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440780282] [2020-07-20 14:59:25,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:25,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:25,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894081195] [2020-07-20 14:59:25,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:25,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:25,315 INFO L87 Difference]: Start difference. First operand 1156 states and 1349 transitions. Second operand 3 states. [2020-07-20 14:59:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:25,429 INFO L93 Difference]: Finished difference Result 2900 states and 3451 transitions. [2020-07-20 14:59:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:25,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-20 14:59:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:25,439 INFO L225 Difference]: With dead ends: 2900 [2020-07-20 14:59:25,440 INFO L226 Difference]: Without dead ends: 1347 [2020-07-20 14:59:25,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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 14:59:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-07-20 14:59:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2020-07-20 14:59:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-07-20 14:59:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1576 transitions. [2020-07-20 14:59:25,563 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1576 transitions. Word has length 121 [2020-07-20 14:59:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:25,564 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1576 transitions. [2020-07-20 14:59:25,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1576 transitions. [2020-07-20 14:59:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 14:59:25,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:25,569 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:25,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:25,780 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-20 14:59:25,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:25,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87556318] [2020-07-20 14:59:25,782 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 14:59:25,861 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 14:59:25,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:25,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:59:25,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 14:59:25,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:25,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87556318] [2020-07-20 14:59:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085537513] [2020-07-20 14:59:25,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:25,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:25,897 INFO L87 Difference]: Start difference. First operand 1347 states and 1576 transitions. Second operand 3 states. [2020-07-20 14:59:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:25,995 INFO L93 Difference]: Finished difference Result 2667 states and 3166 transitions. [2020-07-20 14:59:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:25,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 14:59:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:26,005 INFO L225 Difference]: With dead ends: 2667 [2020-07-20 14:59:26,006 INFO L226 Difference]: Without dead ends: 1341 [2020-07-20 14:59:26,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 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 14:59:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-07-20 14:59:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2020-07-20 14:59:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2020-07-20 14:59:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1552 transitions. [2020-07-20 14:59:26,089 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1552 transitions. Word has length 174 [2020-07-20 14:59:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:26,090 INFO L479 AbstractCegarLoop]: Abstraction has 1341 states and 1552 transitions. [2020-07-20 14:59:26,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1552 transitions. [2020-07-20 14:59:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 14:59:26,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:26,094 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:26,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:26,309 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-20 14:59:26,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:26,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466084914] [2020-07-20 14:59:26,310 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 14:59:26,375 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:59:26,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:26,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 14:59:26,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 14:59:26,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:26,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466084914] [2020-07-20 14:59:26,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:26,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:26,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843031157] [2020-07-20 14:59:26,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:26,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:26,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:26,421 INFO L87 Difference]: Start difference. First operand 1341 states and 1552 transitions. Second operand 3 states. [2020-07-20 14:59:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:26,562 INFO L93 Difference]: Finished difference Result 3117 states and 3644 transitions. [2020-07-20 14:59:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:26,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 14:59:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:26,569 INFO L225 Difference]: With dead ends: 3117 [2020-07-20 14:59:26,570 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 14:59:26,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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 14:59:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 14:59:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 14:59:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 14:59:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1013 transitions. [2020-07-20 14:59:26,637 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1013 transitions. Word has length 175 [2020-07-20 14:59:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:26,638 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1013 transitions. [2020-07-20 14:59:26,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1013 transitions. [2020-07-20 14:59:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 14:59:26,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:26,641 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:26,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:26,857 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-20 14:59:26,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:26,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [451617701] [2020-07-20 14:59:26,858 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 14:59:26,980 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:59:26,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:59:26,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-20 14:59:27,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:59:27,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [451617701] [2020-07-20 14:59:27,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:59:27,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:59:27,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730146545] [2020-07-20 14:59:27,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:59:27,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:59:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:59:27,020 INFO L87 Difference]: Start difference. First operand 896 states and 1013 transitions. Second operand 3 states. [2020-07-20 14:59:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:27,090 INFO L93 Difference]: Finished difference Result 1594 states and 1836 transitions. [2020-07-20 14:59:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:59:27,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 14:59:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:27,097 INFO L225 Difference]: With dead ends: 1594 [2020-07-20 14:59:27,097 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 14:59:27,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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 14:59:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 14:59:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 14:59:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 14:59:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-20 14:59:27,159 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 175 [2020-07-20 14:59:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:27,160 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-20 14:59:27,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:59:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-20 14:59:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 14:59:27,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:59:27,164 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:27,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:27,380 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:59:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:59:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-20 14:59:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:59:27,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374489566] [2020-07-20 14:59:27,381 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 14:59:27,519 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:59:27,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:59:27,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 14:59:27,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:59:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 14:59:27,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:59:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 14:59:27,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374489566] [2020-07-20 14:59:27,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 14:59:27,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-20 14:59:27,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524584672] [2020-07-20 14:59:27,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:59:27,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:59:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:59:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 14:59:27,917 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-20 14:59:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:59:28,415 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-20 14:59:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:59:28,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-20 14:59:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:59:28,419 INFO L225 Difference]: With dead ends: 920 [2020-07-20 14:59:28,419 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 14:59:28,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 14:59:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 14:59:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 14:59:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 14:59:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 14:59:28,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-20 14:59:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:59:28,425 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 14:59:28,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:59:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 14:59:28,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 14:59:28,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:59:28,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 14:59:28,757 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 14:59:31,139 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 14:59:31,648 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 47 [2020-07-20 14:59:31,926 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 14:59:32,257 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:32,582 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:32,686 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-07-20 14:59:33,005 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:33,335 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:33,727 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:34,220 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-07-20 14:59:34,625 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-20 14:59:35,228 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2020-07-20 14:59:35,539 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 14:59:36,135 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 14:59:36,672 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 14:59:37,153 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-07-20 14:59:37,470 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:37,612 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-20 14:59:38,502 WARN L193 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 14:59:38,783 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2020-07-20 14:59:38,949 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 14:59:39,807 WARN L193 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 14:59:40,072 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-20 14:59:40,403 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:41,271 WARN L193 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 14:59:41,584 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-07-20 14:59:42,047 WARN L193 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 14:59:42,284 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 14:59:42,524 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 14:59:42,751 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 14:59:42,934 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-07-20 14:59:43,549 WARN L193 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2020-07-20 14:59:43,789 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-20 14:59:44,212 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-20 14:59:44,527 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 14:59:45,196 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 14:59:45,562 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-07-20 14:59:45,837 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-07-20 14:59:46,050 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-07-20 14:59:46,283 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-07-20 14:59:46,591 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-07-20 14:59:46,625 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-20 14:59:46,625 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse4 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (<= 2 ~m_st~0)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 (not (<= ~t1_pc~0 0)) .cse4) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse8 .cse1 .cse2 .cse3) (or .cse8 .cse5 .cse6 .cse1 (not (= ~token~0 ~local~0)) .cse7))) [2020-07-20 14:59:46,625 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-20 14:59:46,625 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse3 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~m_st~0))) (let ((.cse4 (and .cse3 .cse11)) (.cse2 (= 0 ~m_st~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= 1 ~t1_pc~0) .cse3 (= ~token~0 (+ ~local~0 1))) .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse5 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse5 (and .cse2 (= ~token~0 ~local~0) .cse10) .cse6 .cse8) (or .cse0 .cse1 .cse9 (and .cse10 .cse11) .cse5 .cse7)))) [2020-07-20 14:59:46,626 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-20 14:59:46,626 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse2 (= ~token~0 ~local~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse3 .cse4) .cse5 .cse7 .cse8) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse9) .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse8) (or .cse0 .cse1 (and .cse3 .cse9 .cse4) .cse10 .cse5 .cse7))) [2020-07-20 14:59:46,626 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-20 14:59:46,626 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= 2 ~m_st~0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) .cse5 .cse6) .cse3 .cse7 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse5 .cse6) .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse7 .cse8))) [2020-07-20 14:59:46,626 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-20 14:59:46,626 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~m_st~0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (= |old(~token~0)| ~local~0))) (.cse2 (= 0 ~m_st~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse11 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1))) .cse6 (and .cse4 .cse5 .cse7) .cse8 .cse9 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse6 (and .cse5 .cse7) .cse9 .cse10) (or (and .cse4 .cse11 .cse7) .cse0 .cse1 .cse12 .cse6 .cse9) (or .cse0 .cse1 .cse12 (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 (and .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse11) .cse10))) [2020-07-20 14:59:46,626 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) .cse5) .cse3 .cse6 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 .cse7))) [2020-07-20 14:59:46,627 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-20 14:59:46,627 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-20 14:59:46,627 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-20 14:59:46,627 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-20 14:59:46,627 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-20 14:59:46,627 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-20 14:59:46,628 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse13 (not (= ~token~0 (+ ~local~0 1)))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (<= 2 ~m_st~0)) (.cse2 (not (= 1 ~t1_pc~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse12 (<= 2 ~t1_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse3 (not (= 0 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse4 .cse6 .cse9 .cse10 .cse11) (or .cse1 .cse6 .cse10 .cse11 .cse8) (or .cse1 .cse4 .cse5 .cse6 .cse10 (and .cse12 .cse11)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 (and .cse0 .cse12) .cse6) (or .cse4 .cse5 .cse6 .cse12 .cse9 .cse8) (or .cse1 .cse0 .cse13 .cse2 .cse6 .cse10 .cse11) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse9 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse7 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8))) [2020-07-20 14:59:46,628 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-20 14:59:46,628 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-20 14:59:46,628 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-20 14:59:46,628 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-20 14:59:46,628 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-20 14:59:46,629 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-20 14:59:46,629 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-20 14:59:46,629 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-20 14:59:46,629 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-20 14:59:46,629 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-20 14:59:46,629 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-20 14:59:46,629 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse3 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (<= ~t1_pc~0 0)) .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse0 (not (<= 2 ~t1_st~0)) .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3) (or .cse4 (not (<= 2 ~m_st~0)) .cse1 .cse2) (or .cse4 (not (= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse1 .cse2))) [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 14:59:46,630 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 14:59:46,631 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-20 14:59:46,631 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-20 14:59:46,631 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-20 14:59:46,631 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-20 14:59:46,631 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-20 14:59:46,631 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 0 ~m_st~0) (not (= 0 |old(~m_st~0)|)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (= ~token~0 ~local~0)) (not (<= ~t1_pc~0 0)) (not (<= ~m_pc~0 0))) [2020-07-20 14:59:46,631 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-20 14:59:46,632 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,632 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-20 14:59:46,632 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-20 14:59:46,632 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-20 14:59:46,632 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,632 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,633 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-20 14:59:46,633 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-20 14:59:46,633 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-20 14:59:46,633 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-20 14:59:46,633 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-20 14:59:46,633 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-20 14:59:46,634 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-20 14:59:46,634 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~E_1~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse8 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse3 (and .cse7 .cse11 .cse8)) (.cse6 (and .cse7 .cse12 .cse13 (= ~token~0 ~local~0) .cse8)) (.cse1 (not .cse13)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse12)) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6) (or (and .cse7 .cse8) .cse1 .cse4 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse9 .cse5 .cse11 .cse10)))) [2020-07-20 14:59:46,634 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-20 14:59:46,635 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-20 14:59:46,635 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (<= 2 ~t1_st~0)) (.cse5 (<= ~m_pc~0 0)) (.cse9 (= ~token~0 ~local~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse7 .cse1 .cse3 (and .cse8 .cse9)) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 .cse4) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse6 .cse0 .cse7 (and .cse8 .cse5 .cse9) .cse1 .cse2 .cse3))) [2020-07-20 14:59:46,635 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-20 14:59:46,635 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-20 14:59:46,635 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-20 14:59:46,636 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-20 14:59:46,636 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (= ~token~0 ~local~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (<= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse8 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse4 .cse5 .cse10 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse8 .cse4 .cse10 .cse6 .cse9) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse7 .cse2 .cse8 .cse4 .cse6))) [2020-07-20 14:59:46,636 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-20 14:59:46,636 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 14:59:46,636 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (not (= |old(~token~0)| ~local~0)) (= ~token~0 ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0)) [2020-07-20 14:59:46,636 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 14:59:46,637 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse15 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= ~m_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse4 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 (and .cse3 .cse4 .cse9 .cse5) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse2 .cse3 .cse14 .cse4 .cse9)) (or .cse0 .cse11 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse6 .cse7 (and .cse13 .cse15 (not (= |old(~token~0)| ~local~0)) .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) .cse16) (or .cse17 .cse0 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse15 .cse2 .cse3 .cse14 .cse18 .cse4) .cse16) (or .cse0 .cse6 .cse12 .cse7 .cse8 (and .cse3 .cse14 .cse4 .cse5)) (or .cse17 .cse0 .cse6 .cse7 .cse8 .cse16 (and .cse15 .cse3 .cse18 .cse4 .cse5)) (or .cse17 .cse0 .cse10 .cse11 .cse6 .cse12 .cse7 (and .cse13 .cse3 .cse14 .cse18 .cse4 .cse9)))) [2020-07-20 14:59:46,637 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-20 14:59:46,637 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-20 14:59:46,637 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-20 14:59:46,637 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-20 14:59:46,638 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 14:59:46,638 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse17 (<= |old(~E_M~0)| ~E_M~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse19 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse7 (and .cse12 .cse19 (= 1 ~t1_pc~0) .cse13 .cse16 .cse15)) (.cse14 (<= ~m_pc~0 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not .cse19)) (.cse5 (and .cse12 .cse17 .cse18 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse8 .cse2 .cse3 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse2 .cse10 .cse3) (or .cse0 .cse8 .cse2 .cse3 .cse4) (or .cse11 .cse0 .cse6 .cse7 .cse8 .cse2 .cse10 .cse3 .cse9) (or .cse11 .cse0 .cse7 .cse2 .cse3 .cse4 .cse9) (or (and .cse12 .cse13 .cse14 .cse15) .cse0 .cse2 .cse10 .cse3 .cse4) (or .cse11 .cse0 .cse1 .cse6 .cse7 (and (= 0 ~m_st~0) .cse12 .cse14 .cse16 .cse17 .cse18) .cse2 .cse10 .cse3 .cse5)))) [2020-07-20 14:59:46,638 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 14:59:46,638 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-20 14:59:46,639 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse13 (<= ~m_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0))) (let ((.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse12 .cse17 .cse16 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse8 (and .cse12 .cse17 .cse16 .cse18 .cse13 (= ~token~0 ~local~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse14 (<= |old(~E_M~0)| ~E_M~0)) (.cse15 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse11 .cse5 .cse7 .cse10) (or .cse1 .cse5 .cse6 .cse7 .cse10) (or .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse3 .cse4 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse10 .cse9) (or .cse0 .cse1 .cse11 .cse2 (and .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 (and .cse12 .cse16 .cse13 .cse14 .cse15))))) [2020-07-20 14:59:46,639 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-20 14:59:46,639 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 14:59:46,639 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-20 14:59:46,639 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-20 14:59:46,640 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-20 14:59:46,640 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-20 14:59:46,640 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-20 14:59:46,640 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-20 14:59:46,640 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-20 14:59:46,640 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-20 14:59:46,640 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-20 14:59:46,640 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-20 14:59:46,641 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 14:59:46,641 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-20 14:59:46,642 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,642 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,642 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-20 14:59:46,642 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,643 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 (= ~token~0 (+ ~local~0 1))) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (and .cse1 .cse8 .cse9 .cse2 .cse4 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,643 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,643 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,643 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,644 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,644 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,644 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-20 14:59:46,644 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,644 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-20 14:59:46,645 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,645 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 14:59:46,645 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,645 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,646 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,646 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-20 14:59:46,646 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,646 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-20 14:59:46,646 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 14:59:46,647 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-20 14:59:46,647 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 (+ ~local~0 1)))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse5 .cse7) (or .cse1 .cse0 .cse8 .cse6 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse5) (or .cse0 .cse2 .cse5 .cse9 .cse10) (or .cse1 .cse0 .cse6 .cse2 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse6 (<= ~E_M~0 1) .cse4 .cse5) (or .cse0 .cse1 .cse4 .cse5 .cse10))) [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-20 14:59:46,647 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-20 14:59:46,648 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-20 14:59:46,648 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-20 14:59:46,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 14:59:46,648 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (<= 2 ~T1_E~0) (<= 2 ~E_M~0) (<= ~m_pc~0 0) (= ~token~0 ~local~0) (<= 2 ~M_E~0) (<= ~t1_pc~0 0)) [2020-07-20 14:59:46,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 14:59:46,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 14:59:46,648 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-20 14:59:46,648 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse6 (not (= ~token~0 ~local~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse5 .cse10 .cse6 .cse7) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse10 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse5 .cse10 .cse9 .cse7))) [2020-07-20 14:59:46,649 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-20 14:59:46,649 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-20 14:59:46,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:59:46 BoogieIcfgContainer [2020-07-20 14:59:46,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 14:59:46,727 INFO L168 Benchmark]: Toolchain (without parser) took 28809.25 ms. Allocated memory was 143.7 MB in the beginning and 567.8 MB in the end (delta: 424.1 MB). Free memory was 101.4 MB in the beginning and 397.9 MB in the end (delta: -296.6 MB). Peak memory consumption was 449.0 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,727 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.69 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 178.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,732 INFO L168 Benchmark]: Boogie Preprocessor took 49.98 ms. Allocated memory is still 200.3 MB. Free memory was 178.1 MB in the beginning and 175.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,732 INFO L168 Benchmark]: RCFGBuilder took 565.71 ms. Allocated memory is still 200.3 MB. Free memory was 175.5 MB in the beginning and 144.4 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,733 INFO L168 Benchmark]: TraceAbstraction took 27743.72 ms. Allocated memory was 200.3 MB in the beginning and 567.8 MB in the end (delta: 367.5 MB). Free memory was 143.7 MB in the beginning and 397.9 MB in the end (delta: -254.2 MB). Peak memory consumption was 434.8 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:46,738 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.26 ms. Allocated memory is still 143.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.69 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 178.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.98 ms. Allocated memory is still 200.3 MB. Free memory was 178.1 MB in the beginning and 175.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 565.71 ms. Allocated memory is still 200.3 MB. Free memory was 175.5 MB in the beginning and 144.4 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27743.72 ms. Allocated memory was 200.3 MB in the beginning and 567.8 MB in the end (delta: 367.5 MB). Free memory was 143.7 MB in the beginning and 397.9 MB in the end (delta: -254.2 MB). Peak memory consumption was 434.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) && (((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local))) && (((((((!(2 <= E_1) || 0 == __retres1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || 0 == __retres1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local))) && (((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_pc)) || E_M <= 1) || !(2 <= m_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_1)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(m_pc <= 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st)) && ((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || (2 <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(m_pc <= 0))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || ((2 <= t1_st && 2 <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((2 <= t1_st && \old(E_M) <= E_M) && 2 <= m_st) || !(2 <= E_1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(m_pc <= 0)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == m_st && 2 <= E_1) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || ((((2 <= E_1 && \old(T1_E) <= T1_E) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && \old(T1_E) <= T1_E)) || !(\old(token) == \old(local))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= E_M) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= m_st)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && ((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 0 == __retres1) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(m_pc <= 0))) && (((!(2 <= E_1) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1)) && (((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= T1_E)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && (((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (\old(E_1) <= E_1 && m_pc <= 0))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2624 SDtfs, 2227 SDslu, 2705 SDs, 0 SdLazy, 1357 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1610 GetRequests, 1568 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 251 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3621 PreInvPairs, 4324 NumberOfFragments, 9762 HoareAnnotationTreeSize, 3621 FomulaSimplifications, 18962 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 62 FomulaSimplificationsInter, 35024 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 315150 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4830 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 536/559 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...