./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 747981090a474d9d2269aea1ffd03eef2ddc8848 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 00:36:28,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 00:36:28,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 00:36:28,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 00:36:28,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 00:36:28,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 00:36:28,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 00:36:28,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 00:36:28,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 00:36:28,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 00:36:28,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 00:36:28,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 00:36:28,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 00:36:28,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 00:36:28,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 00:36:28,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 00:36:28,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 00:36:28,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 00:36:28,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 00:36:28,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 00:36:28,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 00:36:28,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 00:36:28,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 00:36:28,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 00:36:28,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 00:36:28,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 00:36:28,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 00:36:28,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 00:36:28,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 00:36:28,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 00:36:28,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 00:36:28,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 00:36:28,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 00:36:28,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 00:36:28,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 00:36:28,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 00:36:28,666 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 00:36:28,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 00:36:28,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 00:36:28,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 00:36:28,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 00:36:28,705 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 00:36:28,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 00:36:28,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 00:36:28,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 00:36:28,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 00:36:28,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 00:36:28,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 00:36:28,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 00:36:28,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 00:36:28,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 00:36:28,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 00:36:28,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 00:36:28,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 00:36:28,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 00:36:28,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 00:36:28,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 00:36:28,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 00:36:28,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 00:36:28,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 00:36:28,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 747981090a474d9d2269aea1ffd03eef2ddc8848 [2018-12-31 00:36:28,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 00:36:28,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 00:36:28,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 00:36:28,805 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 00:36:28,805 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 00:36:28,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:36:28,870 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcfbc36a/a3dd09e5be32420da221889ff7b3408a/FLAG6c1bddb4d [2018-12-31 00:36:29,358 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 00:36:29,359 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:36:29,370 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcfbc36a/a3dd09e5be32420da221889ff7b3408a/FLAG6c1bddb4d [2018-12-31 00:36:29,658 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcfbc36a/a3dd09e5be32420da221889ff7b3408a [2018-12-31 00:36:29,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 00:36:29,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 00:36:29,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 00:36:29,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 00:36:29,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 00:36:29,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:36:29" (1/1) ... [2018-12-31 00:36:29,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579d3eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:29, skipping insertion in model container [2018-12-31 00:36:29,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:36:29" (1/1) ... [2018-12-31 00:36:29,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 00:36:29,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 00:36:30,091 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:36:30,097 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 00:36:30,213 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:36:30,246 INFO L195 MainTranslator]: Completed translation [2018-12-31 00:36:30,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30 WrapperNode [2018-12-31 00:36:30,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 00:36:30,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 00:36:30,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 00:36:30,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 00:36:30,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 00:36:30,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 00:36:30,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 00:36:30,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 00:36:30,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (1/1) ... [2018-12-31 00:36:30,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 00:36:30,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 00:36:30,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 00:36:30,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 00:36:30,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (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 [2018-12-31 00:36:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 00:36:30,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 00:36:32,387 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 00:36:32,388 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-31 00:36:32,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:36:32 BoogieIcfgContainer [2018-12-31 00:36:32,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 00:36:32,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 00:36:32,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 00:36:32,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 00:36:32,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 12:36:29" (1/3) ... [2018-12-31 00:36:32,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8b0b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:36:32, skipping insertion in model container [2018-12-31 00:36:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:36:30" (2/3) ... [2018-12-31 00:36:32,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8b0b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:36:32, skipping insertion in model container [2018-12-31 00:36:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:36:32" (3/3) ... [2018-12-31 00:36:32,398 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:36:32,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 00:36:32,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 00:36:32,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 00:36:32,469 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 00:36:32,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 00:36:32,470 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 00:36:32,470 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 00:36:32,470 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 00:36:32,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 00:36:32,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 00:36:32,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 00:36:32,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 00:36:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-12-31 00:36:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 00:36:32,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:32,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:32,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2018-12-31 00:36:32,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:32,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:32,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:32,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 00:36:32,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 00:36:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 00:36:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 00:36:32,689 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2018-12-31 00:36:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:32,731 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2018-12-31 00:36:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 00:36:32,733 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 00:36:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:32,747 INFO L225 Difference]: With dead ends: 218 [2018-12-31 00:36:32,748 INFO L226 Difference]: Without dead ends: 106 [2018-12-31 00:36:32,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 00:36:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-31 00:36:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-31 00:36:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 00:36:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2018-12-31 00:36:32,795 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2018-12-31 00:36:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:32,796 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2018-12-31 00:36:32,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 00:36:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2018-12-31 00:36:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 00:36:32,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:32,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:32,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2018-12-31 00:36:32,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:32,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:32,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:32,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:32,872 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2018-12-31 00:36:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:33,148 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2018-12-31 00:36:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:33,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-31 00:36:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:33,154 INFO L225 Difference]: With dead ends: 214 [2018-12-31 00:36:33,155 INFO L226 Difference]: Without dead ends: 110 [2018-12-31 00:36:33,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-31 00:36:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-31 00:36:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-31 00:36:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2018-12-31 00:36:33,178 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2018-12-31 00:36:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2018-12-31 00:36:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2018-12-31 00:36:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 00:36:33,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:33,181 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:33,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2018-12-31 00:36:33,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:33,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:33,616 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2018-12-31 00:36:34,103 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2018-12-31 00:36:34,313 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 20 [2018-12-31 00:36:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:34,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:34,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 00:36:34,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 00:36:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 00:36:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:34,319 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 5 states. [2018-12-31 00:36:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:35,396 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2018-12-31 00:36:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 00:36:35,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-31 00:36:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:35,403 INFO L225 Difference]: With dead ends: 326 [2018-12-31 00:36:35,403 INFO L226 Difference]: Without dead ends: 197 [2018-12-31 00:36:35,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:36:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-31 00:36:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2018-12-31 00:36:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-31 00:36:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2018-12-31 00:36:35,421 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2018-12-31 00:36:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2018-12-31 00:36:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 00:36:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2018-12-31 00:36:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 00:36:35,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:35,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:35,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2018-12-31 00:36:35,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:35,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:35,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:35,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:35,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:35,505 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2018-12-31 00:36:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:35,586 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2018-12-31 00:36:35,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:35,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-31 00:36:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:35,589 INFO L225 Difference]: With dead ends: 314 [2018-12-31 00:36:35,589 INFO L226 Difference]: Without dead ends: 133 [2018-12-31 00:36:35,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-31 00:36:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-31 00:36:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-31 00:36:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2018-12-31 00:36:35,609 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2018-12-31 00:36:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:35,609 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2018-12-31 00:36:35,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2018-12-31 00:36:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 00:36:35,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:35,616 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:35,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2018-12-31 00:36:35,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 00:36:35,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:35,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:35,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:35,758 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2018-12-31 00:36:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:35,897 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2018-12-31 00:36:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:35,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 00:36:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:35,900 INFO L225 Difference]: With dead ends: 243 [2018-12-31 00:36:35,900 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 00:36:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 00:36:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-12-31 00:36:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 00:36:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2018-12-31 00:36:35,921 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2018-12-31 00:36:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:35,922 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2018-12-31 00:36:35,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2018-12-31 00:36:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 00:36:35,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:35,925 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:35,925 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2018-12-31 00:36:35,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:35,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:36,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:36,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:36,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:36,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:36,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 00:36:36,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 00:36:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 00:36:36,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:36,200 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2018-12-31 00:36:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:37,386 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2018-12-31 00:36:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 00:36:37,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 00:36:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:37,389 INFO L225 Difference]: With dead ends: 204 [2018-12-31 00:36:37,389 INFO L226 Difference]: Without dead ends: 192 [2018-12-31 00:36:37,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-31 00:36:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2018-12-31 00:36:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-31 00:36:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2018-12-31 00:36:37,398 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2018-12-31 00:36:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:37,399 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2018-12-31 00:36:37,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 00:36:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2018-12-31 00:36:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 00:36:37,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:37,400 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:37,400 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2018-12-31 00:36:37,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:37,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:37,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:37,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:37,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-31 00:36:37,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 00:36:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 00:36:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:36:37,864 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 6 states. [2018-12-31 00:36:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:38,165 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2018-12-31 00:36:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 00:36:38,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-31 00:36:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:38,168 INFO L225 Difference]: With dead ends: 387 [2018-12-31 00:36:38,169 INFO L226 Difference]: Without dead ends: 230 [2018-12-31 00:36:38,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:36:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-31 00:36:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2018-12-31 00:36:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-31 00:36:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2018-12-31 00:36:38,178 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2018-12-31 00:36:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:38,178 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2018-12-31 00:36:38,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 00:36:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2018-12-31 00:36:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 00:36:38,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:38,180 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:38,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2018-12-31 00:36:38,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:38,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 00:36:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:38,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:38,253 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2018-12-31 00:36:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:38,379 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2018-12-31 00:36:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:38,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-31 00:36:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:38,383 INFO L225 Difference]: With dead ends: 409 [2018-12-31 00:36:38,383 INFO L226 Difference]: Without dead ends: 211 [2018-12-31 00:36:38,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-31 00:36:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-12-31 00:36:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-31 00:36:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2018-12-31 00:36:38,395 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2018-12-31 00:36:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2018-12-31 00:36:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2018-12-31 00:36:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 00:36:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:38,397 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:38,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2018-12-31 00:36:38,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:38,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:38,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:38,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 00:36:38,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:38,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:38,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:38,496 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2018-12-31 00:36:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:38,673 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2018-12-31 00:36:38,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:38,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 00:36:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:38,677 INFO L225 Difference]: With dead ends: 375 [2018-12-31 00:36:38,677 INFO L226 Difference]: Without dead ends: 211 [2018-12-31 00:36:38,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-31 00:36:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-12-31 00:36:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-31 00:36:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2018-12-31 00:36:38,685 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2018-12-31 00:36:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:38,687 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2018-12-31 00:36:38,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2018-12-31 00:36:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 00:36:38,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:38,689 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:38,689 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2018-12-31 00:36:38,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 00:36:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:39,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:39,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:39,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 00:36:39,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:39,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-12-31 00:36:39,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 00:36:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 00:36:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:39,169 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2018-12-31 00:36:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:39,677 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2018-12-31 00:36:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 00:36:39,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-31 00:36:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:39,681 INFO L225 Difference]: With dead ends: 485 [2018-12-31 00:36:39,681 INFO L226 Difference]: Without dead ends: 270 [2018-12-31 00:36:39,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-31 00:36:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-12-31 00:36:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-31 00:36:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2018-12-31 00:36:39,691 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2018-12-31 00:36:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:39,691 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2018-12-31 00:36:39,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 00:36:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2018-12-31 00:36:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 00:36:39,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:39,693 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-12-31 00:36:39,693 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2018-12-31 00:36:39,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 00:36:39,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:39,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:39,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:39,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 00:36:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-31 00:36:40,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 00:36:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 00:36:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:36:40,020 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2018-12-31 00:36:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:41,061 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2018-12-31 00:36:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 00:36:41,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 00:36:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:41,065 INFO L225 Difference]: With dead ends: 274 [2018-12-31 00:36:41,065 INFO L226 Difference]: Without dead ends: 262 [2018-12-31 00:36:41,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:36:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-31 00:36:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-12-31 00:36:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-31 00:36:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-31 00:36:41,075 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2018-12-31 00:36:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-31 00:36:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 00:36:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-31 00:36:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 00:36:41,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:41,079 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-12-31 00:36:41,079 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2018-12-31 00:36:41,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:41,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:41,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:41,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:41,329 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:36:41,526 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 00:36:41,737 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-31 00:36:42,123 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 19 [2018-12-31 00:36:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:42,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:42,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:42,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:42,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:42,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:42,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-31 00:36:42,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 00:36:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 00:36:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:36:42,263 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 8 states. [2018-12-31 00:36:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:43,337 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2018-12-31 00:36:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 00:36:43,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-31 00:36:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:43,340 INFO L225 Difference]: With dead ends: 271 [2018-12-31 00:36:43,340 INFO L226 Difference]: Without dead ends: 269 [2018-12-31 00:36:43,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:36:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-31 00:36:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2018-12-31 00:36:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-31 00:36:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2018-12-31 00:36:43,352 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2018-12-31 00:36:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:43,354 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2018-12-31 00:36:43,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 00:36:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2018-12-31 00:36:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 00:36:43,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:43,355 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-12-31 00:36:43,357 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2018-12-31 00:36:43,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:43,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:43,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 00:36:43,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:43,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:43,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:43,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:43,445 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2018-12-31 00:36:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:43,720 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2018-12-31 00:36:43,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:43,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-31 00:36:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:43,724 INFO L225 Difference]: With dead ends: 461 [2018-12-31 00:36:43,724 INFO L226 Difference]: Without dead ends: 245 [2018-12-31 00:36:43,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-31 00:36:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-31 00:36:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-31 00:36:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2018-12-31 00:36:43,735 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2018-12-31 00:36:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:43,736 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2018-12-31 00:36:43,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2018-12-31 00:36:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 00:36:43,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:43,737 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-12-31 00:36:43,737 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2018-12-31 00:36:43,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:43,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-31 00:36:43,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:36:43,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:36:43,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:36:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:36:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:43,831 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2018-12-31 00:36:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:44,105 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2018-12-31 00:36:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:36:44,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 00:36:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:44,107 INFO L225 Difference]: With dead ends: 333 [2018-12-31 00:36:44,107 INFO L226 Difference]: Without dead ends: 155 [2018-12-31 00:36:44,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:36:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-31 00:36:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-12-31 00:36:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-31 00:36:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2018-12-31 00:36:44,115 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2018-12-31 00:36:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:44,115 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2018-12-31 00:36:44,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:36:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2018-12-31 00:36:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 00:36:44,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:44,116 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-12-31 00:36:44,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2018-12-31 00:36:44,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:44,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 00:36:44,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:44,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:44,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:44,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 00:36:44,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:44,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-31 00:36:44,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 00:36:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 00:36:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:44,424 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2018-12-31 00:36:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:44,595 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2018-12-31 00:36:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 00:36:44,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-31 00:36:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:44,598 INFO L225 Difference]: With dead ends: 286 [2018-12-31 00:36:44,598 INFO L226 Difference]: Without dead ends: 194 [2018-12-31 00:36:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:36:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-31 00:36:44,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-12-31 00:36:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-31 00:36:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2018-12-31 00:36:44,605 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2018-12-31 00:36:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:44,605 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2018-12-31 00:36:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 00:36:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2018-12-31 00:36:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 00:36:44,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:44,606 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-12-31 00:36:44,606 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2018-12-31 00:36:44,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:44,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:44,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:45,483 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-12-31 00:36:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:45,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:45,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:45,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:45,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:45,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:45,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-31 00:36:45,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:36:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:36:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:36:45,862 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2018-12-31 00:36:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:46,666 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2018-12-31 00:36:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 00:36:46,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-31 00:36:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:46,669 INFO L225 Difference]: With dead ends: 193 [2018-12-31 00:36:46,669 INFO L226 Difference]: Without dead ends: 191 [2018-12-31 00:36:46,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:36:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-31 00:36:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-31 00:36:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-31 00:36:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2018-12-31 00:36:46,681 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2018-12-31 00:36:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:46,682 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2018-12-31 00:36:46,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:36:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2018-12-31 00:36:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 00:36:46,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:46,683 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2018-12-31 00:36:46,683 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2018-12-31 00:36:46,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:46,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:46,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:47,127 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:36:47,310 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:36:47,528 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:36:48,072 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2018-12-31 00:36:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:48,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:48,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:48,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-31 00:36:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:36:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:36:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:36:48,416 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2018-12-31 00:36:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:48,753 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-12-31 00:36:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 00:36:48,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-31 00:36:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:48,756 INFO L225 Difference]: With dead ends: 194 [2018-12-31 00:36:48,756 INFO L226 Difference]: Without dead ends: 192 [2018-12-31 00:36:48,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:36:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-31 00:36:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-31 00:36:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-31 00:36:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2018-12-31 00:36:48,763 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2018-12-31 00:36:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:48,764 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2018-12-31 00:36:48,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:36:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2018-12-31 00:36:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 00:36:48,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:48,765 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2018-12-31 00:36:48,765 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2018-12-31 00:36:48,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:48,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:48,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:49,384 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2018-12-31 00:36:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:49,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:49,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:49,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:49,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:49,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-12-31 00:36:49,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 00:36:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 00:36:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:36:49,836 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 14 states. [2018-12-31 00:36:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:51,017 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2018-12-31 00:36:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 00:36:51,017 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-12-31 00:36:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:51,019 INFO L225 Difference]: With dead ends: 301 [2018-12-31 00:36:51,019 INFO L226 Difference]: Without dead ends: 211 [2018-12-31 00:36:51,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:36:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-31 00:36:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-31 00:36:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-31 00:36:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2018-12-31 00:36:51,025 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2018-12-31 00:36:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:51,026 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2018-12-31 00:36:51,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 00:36:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2018-12-31 00:36:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 00:36:51,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:51,027 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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] [2018-12-31 00:36:51,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2018-12-31 00:36:51,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 00:36:51,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:51,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:51,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:51,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:52,285 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-12-31 00:36:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 00:36:52,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:52,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-12-31 00:36:52,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 00:36:52,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 00:36:52,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 00:36:52,350 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2018-12-31 00:36:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:52,927 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2018-12-31 00:36:52,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 00:36:52,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-31 00:36:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:52,930 INFO L225 Difference]: With dead ends: 324 [2018-12-31 00:36:52,931 INFO L226 Difference]: Without dead ends: 234 [2018-12-31 00:36:52,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 00:36:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-31 00:36:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-12-31 00:36:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-31 00:36:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2018-12-31 00:36:52,938 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2018-12-31 00:36:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:52,939 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2018-12-31 00:36:52,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 00:36:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-12-31 00:36:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-31 00:36:52,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:52,940 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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] [2018-12-31 00:36:52,940 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2018-12-31 00:36:52,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:53,365 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:36:54,034 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-12-31 00:36:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:54,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:54,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:54,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-31 00:36:54,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 00:36:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 00:36:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:36:54,398 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 10 states. [2018-12-31 00:36:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:54,805 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2018-12-31 00:36:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 00:36:54,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-12-31 00:36:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:54,808 INFO L225 Difference]: With dead ends: 233 [2018-12-31 00:36:54,808 INFO L226 Difference]: Without dead ends: 231 [2018-12-31 00:36:54,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:36:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-31 00:36:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-31 00:36:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-31 00:36:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2018-12-31 00:36:54,816 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2018-12-31 00:36:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:54,816 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2018-12-31 00:36:54,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 00:36:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2018-12-31 00:36:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 00:36:54,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:54,818 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 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] [2018-12-31 00:36:54,818 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2018-12-31 00:36:54,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 00:36:55,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:55,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:55,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:55,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 00:36:55,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 00:36:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 00:36:55,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 00:36:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 00:36:55,417 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2018-12-31 00:36:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:55,561 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2018-12-31 00:36:55,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 00:36:55,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 00:36:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:55,565 INFO L225 Difference]: With dead ends: 364 [2018-12-31 00:36:55,565 INFO L226 Difference]: Without dead ends: 272 [2018-12-31 00:36:55,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 00:36:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-31 00:36:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2018-12-31 00:36:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-31 00:36:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2018-12-31 00:36:55,574 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2018-12-31 00:36:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:55,574 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2018-12-31 00:36:55,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 00:36:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2018-12-31 00:36:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 00:36:55,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:55,575 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 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] [2018-12-31 00:36:55,576 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2018-12-31 00:36:55,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:55,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:55,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:55,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:55,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:56,670 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:36:56,948 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:36:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:57,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:57,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:57,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:57,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:57,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-31 00:36:57,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 00:36:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 00:36:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-31 00:36:57,610 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2018-12-31 00:36:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:57,962 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2018-12-31 00:36:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 00:36:57,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-12-31 00:36:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:57,967 INFO L225 Difference]: With dead ends: 271 [2018-12-31 00:36:57,967 INFO L226 Difference]: Without dead ends: 269 [2018-12-31 00:36:57,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-31 00:36:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-31 00:36:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-12-31 00:36:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-31 00:36:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2018-12-31 00:36:57,976 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2018-12-31 00:36:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:57,976 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2018-12-31 00:36:57,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 00:36:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2018-12-31 00:36:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 00:36:57,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:57,977 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:36:57,978 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:57,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:57,978 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2018-12-31 00:36:57,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:57,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:36:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:36:58,366 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:36:58,541 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:36:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:58,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:36:58,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:36:58,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:36:58,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:36:58,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:36:58,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:36:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:36:59,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:36:59,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2018-12-31 00:36:59,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 00:36:59,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 00:36:59,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-31 00:36:59,140 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2018-12-31 00:36:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:36:59,589 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2018-12-31 00:36:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 00:36:59,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-12-31 00:36:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:36:59,592 INFO L225 Difference]: With dead ends: 272 [2018-12-31 00:36:59,592 INFO L226 Difference]: Without dead ends: 270 [2018-12-31 00:36:59,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-31 00:36:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-31 00:36:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-12-31 00:36:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-31 00:36:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2018-12-31 00:36:59,600 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2018-12-31 00:36:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:36:59,600 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2018-12-31 00:36:59,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 00:36:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2018-12-31 00:36:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-31 00:36:59,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:36:59,602 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 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] [2018-12-31 00:36:59,602 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:36:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:36:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2018-12-31 00:36:59,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:36:59,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:36:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:59,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:36:59,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:36:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 254 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 00:37:00,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:00,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:00,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:00,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:00,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:00,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-12-31 00:37:00,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 00:37:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 00:37:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-12-31 00:37:00,869 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 22 states. [2018-12-31 00:37:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:01,368 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2018-12-31 00:37:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 00:37:01,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2018-12-31 00:37:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:01,371 INFO L225 Difference]: With dead ends: 379 [2018-12-31 00:37:01,372 INFO L226 Difference]: Without dead ends: 289 [2018-12-31 00:37:01,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-12-31 00:37:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-31 00:37:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-12-31 00:37:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-31 00:37:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2018-12-31 00:37:01,382 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2018-12-31 00:37:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:01,383 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2018-12-31 00:37:01,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 00:37:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2018-12-31 00:37:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-31 00:37:01,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:01,387 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:01,387 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2018-12-31 00:37:01,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:01,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:01,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:01,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:01,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 00:37:02,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:02,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:02,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:02,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:02,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 00:37:02,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:02,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-12-31 00:37:02,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:37:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:37:02,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:37:02,411 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 9 states. [2018-12-31 00:37:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:02,749 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2018-12-31 00:37:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 00:37:02,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-12-31 00:37:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:02,753 INFO L225 Difference]: With dead ends: 402 [2018-12-31 00:37:02,753 INFO L226 Difference]: Without dead ends: 312 [2018-12-31 00:37:02,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:37:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-31 00:37:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-12-31 00:37:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-31 00:37:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2018-12-31 00:37:02,764 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2018-12-31 00:37:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:02,764 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2018-12-31 00:37:02,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:37:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-12-31 00:37:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-31 00:37:02,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:02,769 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:02,769 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2018-12-31 00:37:02,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:02,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:03,120 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:37:03,285 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:37:03,575 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2018-12-31 00:37:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:03,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:03,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:03,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:04,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:04,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:04,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:04,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:04,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2018-12-31 00:37:04,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 00:37:04,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 00:37:04,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:37:04,467 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 15 states. [2018-12-31 00:37:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:05,348 INFO L93 Difference]: Finished difference Result 313 states and 436 transitions. [2018-12-31 00:37:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 00:37:05,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 132 [2018-12-31 00:37:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:05,352 INFO L225 Difference]: With dead ends: 313 [2018-12-31 00:37:05,352 INFO L226 Difference]: Without dead ends: 311 [2018-12-31 00:37:05,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-12-31 00:37:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-31 00:37:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-12-31 00:37:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-31 00:37:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2018-12-31 00:37:05,360 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2018-12-31 00:37:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:05,361 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2018-12-31 00:37:05,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 00:37:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2018-12-31 00:37:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-31 00:37:05,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:05,365 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:05,366 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2018-12-31 00:37:05,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:05,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:05,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 00:37:05,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:05,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:05,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:05,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:05,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:05,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 00:37:06,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:06,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-31 00:37:06,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:37:06,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:37:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:37:06,043 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2018-12-31 00:37:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:06,354 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2018-12-31 00:37:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 00:37:06,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2018-12-31 00:37:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:06,359 INFO L225 Difference]: With dead ends: 442 [2018-12-31 00:37:06,359 INFO L226 Difference]: Without dead ends: 350 [2018-12-31 00:37:06,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:37:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-31 00:37:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2018-12-31 00:37:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-12-31 00:37:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2018-12-31 00:37:06,371 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2018-12-31 00:37:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:06,371 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2018-12-31 00:37:06,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:37:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2018-12-31 00:37:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-31 00:37:06,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:06,375 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:06,376 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2018-12-31 00:37:06,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:06,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:06,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:06,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:06,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:06,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:06,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:06,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:07,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-12-31 00:37:07,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 00:37:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 00:37:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-12-31 00:37:07,404 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2018-12-31 00:37:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:07,941 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2018-12-31 00:37:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 00:37:07,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-12-31 00:37:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:07,945 INFO L225 Difference]: With dead ends: 349 [2018-12-31 00:37:07,945 INFO L226 Difference]: Without dead ends: 347 [2018-12-31 00:37:07,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-12-31 00:37:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-31 00:37:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-12-31 00:37:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-12-31 00:37:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2018-12-31 00:37:07,954 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2018-12-31 00:37:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:07,957 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2018-12-31 00:37:07,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 00:37:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2018-12-31 00:37:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-31 00:37:07,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:07,959 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:07,960 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2018-12-31 00:37:07,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:07,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:08,403 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:37:08,565 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:37:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:08,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:08,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:08,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:37:08,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 00:37:09,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:09,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:09,521 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 10 [2018-12-31 00:37:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-12-31 00:37:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-12-31 00:37:09,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 00:37:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 00:37:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-31 00:37:09,846 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 21 states. [2018-12-31 00:37:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:11,581 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2018-12-31 00:37:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 00:37:11,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 155 [2018-12-31 00:37:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:11,585 INFO L225 Difference]: With dead ends: 545 [2018-12-31 00:37:11,585 INFO L226 Difference]: Without dead ends: 449 [2018-12-31 00:37:11,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 00:37:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-31 00:37:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-12-31 00:37:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-31 00:37:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2018-12-31 00:37:11,600 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2018-12-31 00:37:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2018-12-31 00:37:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 00:37:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2018-12-31 00:37:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-31 00:37:11,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:11,604 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:11,604 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2018-12-31 00:37:11,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:11,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:11,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:11,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-31 00:37:11,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:11,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:11,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:11,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-31 00:37:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-31 00:37:12,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 00:37:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 00:37:12,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:37:12,019 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2018-12-31 00:37:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:12,453 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2018-12-31 00:37:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 00:37:12,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-12-31 00:37:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:12,456 INFO L225 Difference]: With dead ends: 927 [2018-12-31 00:37:12,456 INFO L226 Difference]: Without dead ends: 760 [2018-12-31 00:37:12,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:37:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-12-31 00:37:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2018-12-31 00:37:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-31 00:37:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2018-12-31 00:37:12,476 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2018-12-31 00:37:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:12,477 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2018-12-31 00:37:12,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 00:37:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2018-12-31 00:37:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-31 00:37:12,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:12,481 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:12,481 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2018-12-31 00:37:12,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:12,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 45 proven. 611 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 00:37:13,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:13,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:13,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:13,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 00:37:13,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 00:37:13,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-12-31 00:37:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 00:37:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 00:37:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-12-31 00:37:13,635 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 18 states. [2018-12-31 00:37:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:13,894 INFO L93 Difference]: Finished difference Result 864 states and 1212 transitions. [2018-12-31 00:37:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 00:37:13,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-12-31 00:37:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:13,900 INFO L225 Difference]: With dead ends: 864 [2018-12-31 00:37:13,900 INFO L226 Difference]: Without dead ends: 859 [2018-12-31 00:37:13,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-12-31 00:37:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-12-31 00:37:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 852. [2018-12-31 00:37:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-31 00:37:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2018-12-31 00:37:13,920 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2018-12-31 00:37:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:13,921 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2018-12-31 00:37:13,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 00:37:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2018-12-31 00:37:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-31 00:37:13,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:13,923 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:13,923 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2018-12-31 00:37:13,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:13,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:14,560 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:37:14,999 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2018-12-31 00:37:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:15,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:15,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:15,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:37:15,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-31 00:37:15,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:15,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-31 00:37:16,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:16,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-12-31 00:37:16,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-31 00:37:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-31 00:37:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-31 00:37:16,073 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 27 states. [2018-12-31 00:37:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:16,713 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2018-12-31 00:37:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 00:37:16,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2018-12-31 00:37:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:16,718 INFO L225 Difference]: With dead ends: 863 [2018-12-31 00:37:16,719 INFO L226 Difference]: Without dead ends: 861 [2018-12-31 00:37:16,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2018-12-31 00:37:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-12-31 00:37:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2018-12-31 00:37:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-31 00:37:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2018-12-31 00:37:16,740 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2018-12-31 00:37:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:16,740 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2018-12-31 00:37:16,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-31 00:37:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2018-12-31 00:37:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-31 00:37:16,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:16,742 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:16,742 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2018-12-31 00:37:16,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:16,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:16,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:16,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:16,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 00:37:17,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:17,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:17,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 00:37:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 00:37:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 00:37:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 00:37:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 00:37:17,895 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 11 states. [2018-12-31 00:37:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:18,901 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2018-12-31 00:37:18,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 00:37:18,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2018-12-31 00:37:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:18,907 INFO L225 Difference]: With dead ends: 1435 [2018-12-31 00:37:18,907 INFO L226 Difference]: Without dead ends: 959 [2018-12-31 00:37:18,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 00:37:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-31 00:37:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2018-12-31 00:37:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-12-31 00:37:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2018-12-31 00:37:18,933 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2018-12-31 00:37:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:18,934 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2018-12-31 00:37:18,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 00:37:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2018-12-31 00:37:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-31 00:37:18,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:18,938 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:18,938 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:18,939 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2018-12-31 00:37:18,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:18,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:18,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:18,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:37:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:19,226 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:37:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:37:19,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:19,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:19,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:37:19,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-31 00:37:19,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:19,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-31 00:37:20,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:20,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-12-31 00:37:20,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-31 00:37:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-31 00:37:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-12-31 00:37:20,459 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 29 states. [2018-12-31 00:37:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:21,318 INFO L93 Difference]: Finished difference Result 938 states and 1317 transitions. [2018-12-31 00:37:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-31 00:37:21,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2018-12-31 00:37:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:21,323 INFO L225 Difference]: With dead ends: 938 [2018-12-31 00:37:21,323 INFO L226 Difference]: Without dead ends: 936 [2018-12-31 00:37:21,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1058, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 00:37:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-12-31 00:37:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2018-12-31 00:37:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-12-31 00:37:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2018-12-31 00:37:21,347 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2018-12-31 00:37:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:21,347 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2018-12-31 00:37:21,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-31 00:37:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2018-12-31 00:37:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-31 00:37:21,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:21,352 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:21,352 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2018-12-31 00:37:21,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:21,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:21,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 00:37:21,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:21,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:21,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:21,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:21,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 00:37:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-31 00:37:21,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 00:37:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 00:37:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 00:37:21,929 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 12 states. [2018-12-31 00:37:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:22,386 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2018-12-31 00:37:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 00:37:22,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-12-31 00:37:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:22,391 INFO L225 Difference]: With dead ends: 1125 [2018-12-31 00:37:22,391 INFO L226 Difference]: Without dead ends: 1040 [2018-12-31 00:37:22,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 00:37:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-12-31 00:37:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2018-12-31 00:37:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-12-31 00:37:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2018-12-31 00:37:22,418 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2018-12-31 00:37:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:22,418 INFO L480 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2018-12-31 00:37:22,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 00:37:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2018-12-31 00:37:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-31 00:37:22,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:22,423 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:22,423 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2018-12-31 00:37:22,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:22,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-31 00:37:22,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:22,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:37:22,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:37:22,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:22,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-31 00:37:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-31 00:37:23,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 00:37:23,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 00:37:23,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 00:37:23,055 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 13 states. [2018-12-31 00:37:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:23,260 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2018-12-31 00:37:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 00:37:23,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2018-12-31 00:37:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:23,267 INFO L225 Difference]: With dead ends: 1675 [2018-12-31 00:37:23,267 INFO L226 Difference]: Without dead ends: 1121 [2018-12-31 00:37:23,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 00:37:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-12-31 00:37:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2018-12-31 00:37:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-12-31 00:37:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2018-12-31 00:37:23,296 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2018-12-31 00:37:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:23,299 INFO L480 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2018-12-31 00:37:23,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 00:37:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2018-12-31 00:37:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-31 00:37:23,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:23,302 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:23,303 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2018-12-31 00:37:23,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:23,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-31 00:37:24,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:24,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:24,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:37:24,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-31 00:37:24,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:24,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-31 00:37:24,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:24,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-12-31 00:37:24,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 00:37:24,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 00:37:24,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:37:24,433 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 14 states. [2018-12-31 00:37:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:24,684 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2018-12-31 00:37:24,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 00:37:24,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2018-12-31 00:37:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:24,690 INFO L225 Difference]: With dead ends: 1287 [2018-12-31 00:37:24,690 INFO L226 Difference]: Without dead ends: 1202 [2018-12-31 00:37:24,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:37:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-12-31 00:37:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2018-12-31 00:37:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-12-31 00:37:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2018-12-31 00:37:24,723 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2018-12-31 00:37:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:24,723 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2018-12-31 00:37:24,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 00:37:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2018-12-31 00:37:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-31 00:37:24,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:24,754 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:24,754 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:24,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2018-12-31 00:37:24,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:24,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-31 00:37:25,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:25,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:25,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:37:25,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-31 00:37:25,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:25,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:25,706 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-31 00:37:26,163 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2018-12-31 00:37:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-12-31 00:37:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-12-31 00:37:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 00:37:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 00:37:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-12-31 00:37:26,251 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2018-12-31 00:37:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:27,147 INFO L93 Difference]: Finished difference Result 1314 states and 1834 transitions. [2018-12-31 00:37:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-31 00:37:27,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-12-31 00:37:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:27,151 INFO L225 Difference]: With dead ends: 1314 [2018-12-31 00:37:27,151 INFO L226 Difference]: Without dead ends: 682 [2018-12-31 00:37:27,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-12-31 00:37:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-31 00:37:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 659. [2018-12-31 00:37:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-31 00:37:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-12-31 00:37:27,166 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2018-12-31 00:37:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:27,166 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-12-31 00:37:27,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 00:37:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-12-31 00:37:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-12-31 00:37:27,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:27,169 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:27,169 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:27,169 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2018-12-31 00:37:27,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:27,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:27,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:37:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-31 00:37:27,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:37:27,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:37:27,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 00:37:28,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 00:37:28,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:37:28,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:37:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-31 00:37:28,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:37:28,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-12-31 00:37:28,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 00:37:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 00:37:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 00:37:28,313 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 18 states. [2018-12-31 00:37:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:37:28,661 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2018-12-31 00:37:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 00:37:28,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2018-12-31 00:37:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:37:28,666 INFO L225 Difference]: With dead ends: 865 [2018-12-31 00:37:28,666 INFO L226 Difference]: Without dead ends: 780 [2018-12-31 00:37:28,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 00:37:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-12-31 00:37:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2018-12-31 00:37:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-31 00:37:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2018-12-31 00:37:28,681 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2018-12-31 00:37:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:37:28,681 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2018-12-31 00:37:28,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 00:37:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2018-12-31 00:37:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-12-31 00:37:28,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:37:28,684 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:37:28,684 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:37:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:37:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2018-12-31 00:37:28,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:37:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:37:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:28,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:37:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:37:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 00:37:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 00:37:30,159 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 00:37:30,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 12:37:30 BoogieIcfgContainer [2018-12-31 00:37:30,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 00:37:30,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 00:37:30,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 00:37:30,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 00:37:30,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:36:32" (3/4) ... [2018-12-31 00:37:30,459 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 00:37:30,759 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 00:37:30,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 00:37:30,760 INFO L168 Benchmark]: Toolchain (without parser) took 61097.53 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 600.8 MB). Free memory was 952.7 MB in the beginning and 976.9 MB in the end (delta: -24.2 MB). Peak memory consumption was 576.6 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,760 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 00:37:30,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,761 INFO L168 Benchmark]: Boogie Preprocessor took 75.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,765 INFO L168 Benchmark]: RCFGBuilder took 1912.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,765 INFO L168 Benchmark]: TraceAbstraction took 58063.59 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 492.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 493.6 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,766 INFO L168 Benchmark]: Witness Printer took 305.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 976.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-31 00:37:30,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 152.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1912.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58063.59 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 492.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 493.6 MB. Max. memory is 11.5 GB. * Witness Printer took 305.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 976.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L48] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L569] __VERIFIER_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. UNSAFE Result, 57.9s OverallTime, 40 OverallIterations, 35 TraceHistogramMax, 20.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8467 SDtfs, 13402 SDslu, 53910 SDs, 0 SdLazy, 8343 SolverSat, 655 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4447 GetRequests, 4004 SyntacticMatches, 41 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 24.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 371 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 6913217 SizeOfPredicates, 67 NumberOfNonLiveVariables, 21692 ConjunctsInSsa, 693 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 8400/31839 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...