./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/systemc/transmitter.02_false-unreach-call_false-termination.cil.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 0c244c639ec9718adcbacffa967b748c52a23cd0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-12 15:24:27,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:24:27,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:24:27,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:24:27,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:24:27,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:24:27,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:24:27,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:24:27,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:24:27,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:24:27,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:24:27,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:24:27,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:24:27,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:24:27,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:24:27,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:24:27,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:24:27,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:24:27,470 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:24:27,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:24:27,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:24:27,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:24:27,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:24:27,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:24:27,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:24:27,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:24:27,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:24:27,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:24:27,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:24:27,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:24:27,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:24:27,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:24:27,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:24:27,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:24:27,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:24:27,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:24:27,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:24:27,504 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:24:27,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:24:27,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:24:27,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:24:27,506 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:24:27,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:24:27,506 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:24:27,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:24:27,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:24:27,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:24:27,508 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:24:27,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:24:27,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:24:27,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:24:27,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:24:27,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:24:27,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:24:27,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:24:27,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:24:27,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:24:27,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:24:27,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:24:27,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:24:27,513 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 -> 0c244c639ec9718adcbacffa967b748c52a23cd0 [2019-01-12 15:24:27,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:24:27,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:24:27,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:24:27,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:24:27,569 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:24:27,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:27,625 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ed21178/25475bb5add3450bbeca1873cbb3bbd1/FLAG8bab328bd [2019-01-12 15:24:28,092 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:24:28,093 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:28,109 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ed21178/25475bb5add3450bbeca1873cbb3bbd1/FLAG8bab328bd [2019-01-12 15:24:28,438 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ed21178/25475bb5add3450bbeca1873cbb3bbd1 [2019-01-12 15:24:28,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:24:28,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:24:28,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:24:28,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:24:28,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:24:28,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:28,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a87f272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28, skipping insertion in model container [2019-01-12 15:24:28,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:28,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:24:28,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:24:28,831 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:24:28,841 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:24:28,913 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:24:28,939 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:24:28,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28 WrapperNode [2019-01-12 15:24:28,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:24:28,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:24:28,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:24:28,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:24:28,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:28,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:24:29,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:24:29,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:24:29,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:24:29,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (1/1) ... [2019-01-12 15:24:29,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:24:29,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:24:29,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:24:29,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:24:29,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (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 [2019-01-12 15:24:29,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:24:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:24:30,520 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:24:30,520 INFO L286 CfgBuilder]: Removed 94 assue(true) statements. [2019-01-12 15:24:30,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:30 BoogieIcfgContainer [2019-01-12 15:24:30,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:24:30,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:24:30,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:24:30,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:24:30,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:24:28" (1/3) ... [2019-01-12 15:24:30,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afb50b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:24:30, skipping insertion in model container [2019-01-12 15:24:30,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:28" (2/3) ... [2019-01-12 15:24:30,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afb50b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:24:30, skipping insertion in model container [2019-01-12 15:24:30,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:30" (3/3) ... [2019-01-12 15:24:30,529 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:30,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:24:30,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:24:30,562 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:24:30,593 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:24:30,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:24:30,594 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:24:30,594 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:24:30,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:24:30,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:24:30,595 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:24:30,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:24:30,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:24:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-01-12 15:24:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:30,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:30,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:30,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2019-01-12 15:24:30,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:30,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:30,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:30,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:30,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:30,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:30,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:30,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:30,827 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2019-01-12 15:24:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:30,909 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2019-01-12 15:24:30,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:30,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:30,930 INFO L225 Difference]: With dead ends: 379 [2019-01-12 15:24:30,931 INFO L226 Difference]: Without dead ends: 188 [2019-01-12 15:24:30,935 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 [2019-01-12 15:24:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-12 15:24:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-01-12 15:24:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 15:24:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2019-01-12 15:24:30,991 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2019-01-12 15:24:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:30,992 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2019-01-12 15:24:30,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2019-01-12 15:24:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:30,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:30,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:30,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2019-01-12 15:24:30,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:30,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:31,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:31,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,081 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2019-01-12 15:24:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:31,372 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2019-01-12 15:24:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:31,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:31,380 INFO L225 Difference]: With dead ends: 498 [2019-01-12 15:24:31,382 INFO L226 Difference]: Without dead ends: 317 [2019-01-12 15:24:31,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-01-12 15:24:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2019-01-12 15:24:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:24:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2019-01-12 15:24:31,444 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2019-01-12 15:24:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:31,444 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2019-01-12 15:24:31,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2019-01-12 15:24:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:31,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:31,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:31,447 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2019-01-12 15:24:31,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:31,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:31,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,554 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2019-01-12 15:24:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:31,635 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2019-01-12 15:24:31,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:31,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:31,640 INFO L225 Difference]: With dead ends: 622 [2019-01-12 15:24:31,641 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:24:31,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:24:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-01-12 15:24:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:24:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2019-01-12 15:24:31,689 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2019-01-12 15:24:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:31,690 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2019-01-12 15:24:31,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2019-01-12 15:24:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:31,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:31,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:31,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2019-01-12 15:24:31,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:31,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:31,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:31,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,761 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2019-01-12 15:24:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:31,838 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2019-01-12 15:24:31,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:31,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:31,841 INFO L225 Difference]: With dead ends: 621 [2019-01-12 15:24:31,841 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:24:31,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:24:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-01-12 15:24:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:24:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2019-01-12 15:24:31,868 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2019-01-12 15:24:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:31,868 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2019-01-12 15:24:31,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2019-01-12 15:24:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:31,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:31,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:31,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2019-01-12 15:24:31,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:31,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:31,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:31,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:31,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:31,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:31,976 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2019-01-12 15:24:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:32,139 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2019-01-12 15:24:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:32,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:32,142 INFO L225 Difference]: With dead ends: 620 [2019-01-12 15:24:32,142 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:24:32,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:24:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-01-12 15:24:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:24:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2019-01-12 15:24:32,163 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2019-01-12 15:24:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:32,164 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-01-12 15:24:32,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2019-01-12 15:24:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:32,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:32,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:32,166 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2019-01-12 15:24:32,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:32,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:32,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:32,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:32,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:32,241 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2019-01-12 15:24:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:32,492 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2019-01-12 15:24:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:32,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:32,495 INFO L225 Difference]: With dead ends: 619 [2019-01-12 15:24:32,495 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:24:32,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:24:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-01-12 15:24:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:24:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2019-01-12 15:24:32,515 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2019-01-12 15:24:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:32,515 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2019-01-12 15:24:32,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2019-01-12 15:24:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:24:32,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:32,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:32,517 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2019-01-12 15:24:32,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:32,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:32,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:32,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:32,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:32,566 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 3 states. [2019-01-12 15:24:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:32,972 INFO L93 Difference]: Finished difference Result 870 states and 1162 transitions. [2019-01-12 15:24:32,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:32,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:24:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:32,977 INFO L225 Difference]: With dead ends: 870 [2019-01-12 15:24:32,978 INFO L226 Difference]: Without dead ends: 592 [2019-01-12 15:24:32,979 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 [2019-01-12 15:24:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-01-12 15:24:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 556. [2019-01-12 15:24:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-01-12 15:24:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2019-01-12 15:24:33,016 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 49 [2019-01-12 15:24:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:33,016 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2019-01-12 15:24:33,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2019-01-12 15:24:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 15:24:33,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:33,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:33,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -397727545, now seen corresponding path program 1 times [2019-01-12 15:24:33,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:33,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:33,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:33,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:33,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:33,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:33,111 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand 3 states. [2019-01-12 15:24:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:33,548 INFO L93 Difference]: Finished difference Result 1454 states and 1913 transitions. [2019-01-12 15:24:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:33,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 15:24:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:33,558 INFO L225 Difference]: With dead ends: 1454 [2019-01-12 15:24:33,559 INFO L226 Difference]: Without dead ends: 968 [2019-01-12 15:24:33,561 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 [2019-01-12 15:24:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-01-12 15:24:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2019-01-12 15:24:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-01-12 15:24:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1204 transitions. [2019-01-12 15:24:33,636 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1204 transitions. Word has length 50 [2019-01-12 15:24:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:33,636 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1204 transitions. [2019-01-12 15:24:33,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1204 transitions. [2019-01-12 15:24:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:24:33,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:33,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:33,639 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 765911831, now seen corresponding path program 1 times [2019-01-12 15:24:33,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:33,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:33,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:33,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:33,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:33,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:33,736 INFO L87 Difference]: Start difference. First operand 926 states and 1204 transitions. Second operand 3 states. [2019-01-12 15:24:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:34,178 INFO L93 Difference]: Finished difference Result 2626 states and 3421 transitions. [2019-01-12 15:24:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:34,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 15:24:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:34,190 INFO L225 Difference]: With dead ends: 2626 [2019-01-12 15:24:34,190 INFO L226 Difference]: Without dead ends: 1750 [2019-01-12 15:24:34,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-01-12 15:24:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1734. [2019-01-12 15:24:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-01-12 15:24:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2234 transitions. [2019-01-12 15:24:34,342 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2234 transitions. Word has length 51 [2019-01-12 15:24:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:34,342 INFO L480 AbstractCegarLoop]: Abstraction has 1734 states and 2234 transitions. [2019-01-12 15:24:34,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2234 transitions. [2019-01-12 15:24:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 15:24:34,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:34,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:34,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1533277321, now seen corresponding path program 1 times [2019-01-12 15:24:34,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:34,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:34,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:34,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:34,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:34,431 INFO L87 Difference]: Start difference. First operand 1734 states and 2234 transitions. Second operand 3 states. [2019-01-12 15:24:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:34,939 INFO L93 Difference]: Finished difference Result 5068 states and 6521 transitions. [2019-01-12 15:24:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:34,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-12 15:24:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:34,961 INFO L225 Difference]: With dead ends: 5068 [2019-01-12 15:24:34,961 INFO L226 Difference]: Without dead ends: 3402 [2019-01-12 15:24:34,967 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 [2019-01-12 15:24:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-01-12 15:24:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2019-01-12 15:24:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2019-01-12 15:24:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4340 transitions. [2019-01-12 15:24:35,117 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4340 transitions. Word has length 66 [2019-01-12 15:24:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:35,117 INFO L480 AbstractCegarLoop]: Abstraction has 3402 states and 4340 transitions. [2019-01-12 15:24:35,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4340 transitions. [2019-01-12 15:24:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 15:24:35,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:35,123 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:35,124 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -883662481, now seen corresponding path program 1 times [2019-01-12 15:24:35,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:35,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:24:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:35,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:24:35,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:24:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:24:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:24:35,420 INFO L87 Difference]: Start difference. First operand 3402 states and 4340 transitions. Second operand 5 states. [2019-01-12 15:24:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:36,796 INFO L93 Difference]: Finished difference Result 10802 states and 13699 transitions. [2019-01-12 15:24:36,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:24:36,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-12 15:24:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:36,834 INFO L225 Difference]: With dead ends: 10802 [2019-01-12 15:24:36,835 INFO L226 Difference]: Without dead ends: 7492 [2019-01-12 15:24:36,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:24:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-01-12 15:24:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 3546. [2019-01-12 15:24:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-01-12 15:24:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4448 transitions. [2019-01-12 15:24:37,236 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4448 transitions. Word has length 89 [2019-01-12 15:24:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:37,237 INFO L480 AbstractCegarLoop]: Abstraction has 3546 states and 4448 transitions. [2019-01-12 15:24:37,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:24:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4448 transitions. [2019-01-12 15:24:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 15:24:37,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:37,243 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:37,243 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash -305176077, now seen corresponding path program 1 times [2019-01-12 15:24:37,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:37,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:24:37,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:37,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:37,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:37,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:37,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:37,363 INFO L87 Difference]: Start difference. First operand 3546 states and 4448 transitions. Second operand 3 states. [2019-01-12 15:24:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:37,894 INFO L93 Difference]: Finished difference Result 10194 states and 12806 transitions. [2019-01-12 15:24:37,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:37,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-12 15:24:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:37,919 INFO L225 Difference]: With dead ends: 10194 [2019-01-12 15:24:37,920 INFO L226 Difference]: Without dead ends: 6712 [2019-01-12 15:24:37,927 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 [2019-01-12 15:24:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-01-12 15:24:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6494. [2019-01-12 15:24:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-01-12 15:24:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8084 transitions. [2019-01-12 15:24:38,262 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8084 transitions. Word has length 89 [2019-01-12 15:24:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:38,262 INFO L480 AbstractCegarLoop]: Abstraction has 6494 states and 8084 transitions. [2019-01-12 15:24:38,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8084 transitions. [2019-01-12 15:24:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 15:24:38,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:38,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:38,267 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1278665036, now seen corresponding path program 1 times [2019-01-12 15:24:38,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:38,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:24:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:38,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:24:38,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:24:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:24:38,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:24:38,418 INFO L87 Difference]: Start difference. First operand 6494 states and 8084 transitions. Second operand 5 states. [2019-01-12 15:24:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:39,447 INFO L93 Difference]: Finished difference Result 15348 states and 19199 transitions. [2019-01-12 15:24:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:24:39,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-12 15:24:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:39,484 INFO L225 Difference]: With dead ends: 15348 [2019-01-12 15:24:39,484 INFO L226 Difference]: Without dead ends: 8934 [2019-01-12 15:24:39,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:24:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2019-01-12 15:24:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 6542. [2019-01-12 15:24:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-12 15:24:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8000 transitions. [2019-01-12 15:24:40,029 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8000 transitions. Word has length 89 [2019-01-12 15:24:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:40,029 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 8000 transitions. [2019-01-12 15:24:40,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:24:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8000 transitions. [2019-01-12 15:24:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 15:24:40,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:40,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:40,038 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash 211800632, now seen corresponding path program 1 times [2019-01-12 15:24:40,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:40,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:40,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:40,134 INFO L87 Difference]: Start difference. First operand 6542 states and 8000 transitions. Second operand 3 states. [2019-01-12 15:24:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:40,917 INFO L93 Difference]: Finished difference Result 9812 states and 12049 transitions. [2019-01-12 15:24:40,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:40,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-12 15:24:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:40,935 INFO L225 Difference]: With dead ends: 9812 [2019-01-12 15:24:40,936 INFO L226 Difference]: Without dead ends: 6542 [2019-01-12 15:24:40,942 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 [2019-01-12 15:24:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2019-01-12 15:24:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 6512. [2019-01-12 15:24:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-01-12 15:24:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7866 transitions. [2019-01-12 15:24:41,416 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7866 transitions. Word has length 89 [2019-01-12 15:24:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:41,417 INFO L480 AbstractCegarLoop]: Abstraction has 6512 states and 7866 transitions. [2019-01-12 15:24:41,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7866 transitions. [2019-01-12 15:24:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-12 15:24:41,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:41,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:41,424 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -974468191, now seen corresponding path program 1 times [2019-01-12 15:24:41,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:41,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:24:41,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:41,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:24:41,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:24:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:24:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:24:41,540 INFO L87 Difference]: Start difference. First operand 6512 states and 7866 transitions. Second operand 5 states. [2019-01-12 15:24:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:42,113 INFO L93 Difference]: Finished difference Result 12634 states and 15323 transitions. [2019-01-12 15:24:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:24:42,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-12 15:24:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:42,127 INFO L225 Difference]: With dead ends: 12634 [2019-01-12 15:24:42,128 INFO L226 Difference]: Without dead ends: 6178 [2019-01-12 15:24:42,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:24:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-01-12 15:24:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4920. [2019-01-12 15:24:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2019-01-12 15:24:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5854 transitions. [2019-01-12 15:24:42,490 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5854 transitions. Word has length 90 [2019-01-12 15:24:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:42,490 INFO L480 AbstractCegarLoop]: Abstraction has 4920 states and 5854 transitions. [2019-01-12 15:24:42,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:24:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5854 transitions. [2019-01-12 15:24:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 15:24:42,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:42,494 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:42,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2019-01-12 15:24:42,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:42,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:42,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:42,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:42,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:42,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:42,577 INFO L87 Difference]: Start difference. First operand 4920 states and 5854 transitions. Second operand 3 states. [2019-01-12 15:24:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:42,985 INFO L93 Difference]: Finished difference Result 9778 states and 11642 transitions. [2019-01-12 15:24:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:42,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-12 15:24:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:42,993 INFO L225 Difference]: With dead ends: 9778 [2019-01-12 15:24:42,993 INFO L226 Difference]: Without dead ends: 4190 [2019-01-12 15:24:43,000 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 [2019-01-12 15:24:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-01-12 15:24:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4186. [2019-01-12 15:24:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-01-12 15:24:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4930 transitions. [2019-01-12 15:24:43,263 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4930 transitions. Word has length 92 [2019-01-12 15:24:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:43,263 INFO L480 AbstractCegarLoop]: Abstraction has 4186 states and 4930 transitions. [2019-01-12 15:24:43,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4930 transitions. [2019-01-12 15:24:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 15:24:43,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:43,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:43,267 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2019-01-12 15:24:43,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:43,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:24:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:43,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:43,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:43,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:43,340 INFO L87 Difference]: Start difference. First operand 4186 states and 4930 transitions. Second operand 3 states. [2019-01-12 15:24:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:43,588 INFO L93 Difference]: Finished difference Result 8752 states and 10233 transitions. [2019-01-12 15:24:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:43,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-12 15:24:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:43,595 INFO L225 Difference]: With dead ends: 8752 [2019-01-12 15:24:43,595 INFO L226 Difference]: Without dead ends: 2868 [2019-01-12 15:24:43,602 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 [2019-01-12 15:24:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-01-12 15:24:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2790. [2019-01-12 15:24:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-12 15:24:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3146 transitions. [2019-01-12 15:24:43,886 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3146 transitions. Word has length 116 [2019-01-12 15:24:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:43,886 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 3146 transitions. [2019-01-12 15:24:43,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3146 transitions. [2019-01-12 15:24:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:24:43,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:43,891 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:43,891 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2019-01-12 15:24:43,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:44,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:44,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:44,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:44,021 INFO L87 Difference]: Start difference. First operand 2790 states and 3146 transitions. Second operand 3 states. [2019-01-12 15:24:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:44,343 INFO L93 Difference]: Finished difference Result 3172 states and 3583 transitions. [2019-01-12 15:24:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:44,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-01-12 15:24:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:44,348 INFO L225 Difference]: With dead ends: 3172 [2019-01-12 15:24:44,348 INFO L226 Difference]: Without dead ends: 2470 [2019-01-12 15:24:44,351 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 [2019-01-12 15:24:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-01-12 15:24:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2019-01-12 15:24:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-01-12 15:24:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2766 transitions. [2019-01-12 15:24:44,556 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2766 transitions. Word has length 117 [2019-01-12 15:24:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:44,558 INFO L480 AbstractCegarLoop]: Abstraction has 2470 states and 2766 transitions. [2019-01-12 15:24:44,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2766 transitions. [2019-01-12 15:24:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 15:24:44,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:44,564 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:44,564 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2019-01-12 15:24:44,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:44,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:44,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:24:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:24:44,656 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:24:44,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:24:44 BoogieIcfgContainer [2019-01-12 15:24:44,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:24:44,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:24:44,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:24:44,782 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:24:44,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:30" (3/4) ... [2019-01-12 15:24:44,787 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:24:44,957 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:24:44,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:24:44,958 INFO L168 Benchmark]: Toolchain (without parser) took 16514.26 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 776.5 MB). Free memory was 947.3 MB in the beginning and 1.4 GB in the end (delta: -437.5 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,960 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-12 15:24:44,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,961 INFO L168 Benchmark]: Boogie Preprocessor took 82.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,962 INFO L168 Benchmark]: RCFGBuilder took 1358.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,962 INFO L168 Benchmark]: TraceAbstraction took 14259.32 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 636.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -326.8 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,962 INFO L168 Benchmark]: Witness Printer took 175.56 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:44,967 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.16 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 493.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1358.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14259.32 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 636.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -326.8 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. * Witness Printer took 175.56 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. UNSAFE Result, 14.1s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5274 SDtfs, 4949 SDslu, 4000 SDs, 0 SdLazy, 329 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6542occurred in iteration=13, 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: 3.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 8022 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 148665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 126/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...