./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.01_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/token_ring.01_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 59598ef74ac7afb6c962e2cc2ba26af488759b7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:13:02,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:13:02,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:13:02,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:13:02,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:13:02,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:13:02,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:13:02,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:13:02,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:13:02,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:13:02,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:13:02,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:13:02,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:13:02,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:13:02,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:13:02,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:13:02,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:13:02,561 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:13:02,563 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:13:02,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:13:02,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:13:02,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:13:02,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:13:02,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:13:02,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:13:02,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:13:02,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:13:02,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:13:02,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:13:02,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:13:02,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:13:02,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:13:02,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:13:02,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:13:02,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:13:02,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:13:02,580 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:13:02,596 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:13:02,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:13:02,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:13:02,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:13:02,598 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:13:02,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:13:02,598 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:13:02,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:13:02,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:13:02,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:13:02,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:13:02,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:13:02,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:13:02,601 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:13:02,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:13:02,601 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:13:02,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:13:02,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:13:02,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:13:02,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:13:02,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:13:02,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:13:02,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:13:02,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:13:02,603 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:13:02,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:13:02,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:13:02,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:13:02,604 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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-01-12 15:13:02,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:13:02,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:13:02,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:13:02,663 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:13:02,663 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:13:02,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:02,726 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb997a526/4c2f336a44494e068c3495d4c71d2b30/FLAG1173cfdfd [2019-01-12 15:13:03,244 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:13:03,245 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:03,259 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb997a526/4c2f336a44494e068c3495d4c71d2b30/FLAG1173cfdfd [2019-01-12 15:13:03,576 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb997a526/4c2f336a44494e068c3495d4c71d2b30 [2019-01-12 15:13:03,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:13:03,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:13:03,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:03,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:13:03,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:13:03,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:03,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d153cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03, skipping insertion in model container [2019-01-12 15:13:03,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:03,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:13:03,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:13:03,883 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:03,889 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:13:03,943 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:03,968 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:13:03,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03 WrapperNode [2019-01-12 15:13:03,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:03,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:03,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:13:03,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:13:03,978 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:13:03" (1/1) ... [2019-01-12 15:13:03,987 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:13:03" (1/1) ... [2019-01-12 15:13:04,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:04,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:13:04,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:13:04,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:13:04,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (1/1) ... [2019-01-12 15:13:04,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:13:04,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:13:04,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:13:04,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:13:04,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (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:13:04,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:13:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:13:05,332 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:13:05,333 INFO L286 CfgBuilder]: Removed 82 assue(true) statements. [2019-01-12 15:13:05,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:05 BoogieIcfgContainer [2019-01-12 15:13:05,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:13:05,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:13:05,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:13:05,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:13:05,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:13:03" (1/3) ... [2019-01-12 15:13:05,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b328351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:05, skipping insertion in model container [2019-01-12 15:13:05,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:03" (2/3) ... [2019-01-12 15:13:05,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b328351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:05, skipping insertion in model container [2019-01-12 15:13:05,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:05" (3/3) ... [2019-01-12 15:13:05,343 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:05,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:13:05,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 15:13:05,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 15:13:05,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:13:05,414 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:13:05,414 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:13:05,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:13:05,415 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:13:05,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:13:05,415 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:13:05,415 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:13:05,415 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:13:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-01-12 15:13:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:05,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:05,443 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] [2019-01-12 15:13:05,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-01-12 15:13:05,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:05,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:05,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:05,600 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:13:05,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:05,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:05,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:05,629 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-01-12 15:13:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:05,698 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-01-12 15:13:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:05,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:05,715 INFO L225 Difference]: With dead ends: 291 [2019-01-12 15:13:05,716 INFO L226 Difference]: Without dead ends: 144 [2019-01-12 15:13:05,720 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:13:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-12 15:13:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-01-12 15:13:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 15:13:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-01-12 15:13:05,771 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-01-12 15:13:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:05,771 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-01-12 15:13:05,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-01-12 15:13:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:05,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:05,773 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] [2019-01-12 15:13:05,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-01-12 15:13:05,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:05,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:05,851 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:13:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:05,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:05,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:05,856 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-01-12 15:13:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:05,997 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-01-12 15:13:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:05,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:06,004 INFO L225 Difference]: With dead ends: 384 [2019-01-12 15:13:06,004 INFO L226 Difference]: Without dead ends: 246 [2019-01-12 15:13:06,009 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:13:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-12 15:13:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-01-12 15:13:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 15:13:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-01-12 15:13:06,064 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-01-12 15:13:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:06,065 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-01-12 15:13:06,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-01-12 15:13:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:06,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:06,067 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] [2019-01-12 15:13:06,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-01-12 15:13:06,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:06,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:06,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:06,135 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:13:06,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:06,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:06,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:06,137 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-01-12 15:13:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:06,199 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-01-12 15:13:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:06,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:06,205 INFO L225 Difference]: With dead ends: 477 [2019-01-12 15:13:06,207 INFO L226 Difference]: Without dead ends: 242 [2019-01-12 15:13:06,209 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:13:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-12 15:13:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-01-12 15:13:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 15:13:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-01-12 15:13:06,250 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-01-12 15:13:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:06,251 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-01-12 15:13:06,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-01-12 15:13:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:06,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:06,253 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] [2019-01-12 15:13:06,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-01-12 15:13:06,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:06,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:06,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:06,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:06,319 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:13:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:06,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:06,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:06,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:06,321 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-01-12 15:13:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:06,448 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-01-12 15:13:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:06,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:06,456 INFO L225 Difference]: With dead ends: 476 [2019-01-12 15:13:06,456 INFO L226 Difference]: Without dead ends: 242 [2019-01-12 15:13:06,457 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:13:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-12 15:13:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-01-12 15:13:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 15:13:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-01-12 15:13:06,485 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-01-12 15:13:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:06,486 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-01-12 15:13:06,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-01-12 15:13:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:06,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:06,490 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] [2019-01-12 15:13:06,491 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-01-12 15:13:06,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:06,539 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:13:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:06,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:06,541 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-01-12 15:13:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:06,698 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-01-12 15:13:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:06,702 INFO L225 Difference]: With dead ends: 475 [2019-01-12 15:13:06,702 INFO L226 Difference]: Without dead ends: 242 [2019-01-12 15:13:06,703 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:13:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-12 15:13:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-01-12 15:13:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 15:13:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-01-12 15:13:06,719 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-01-12 15:13:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:06,719 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-01-12 15:13:06,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-01-12 15:13:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:13:06,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:06,722 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] [2019-01-12 15:13:06,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-01-12 15:13:06,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:06,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:06,832 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:13:06,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:06,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:06,834 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-01-12 15:13:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:07,106 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-01-12 15:13:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:07,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:13:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:07,110 INFO L225 Difference]: With dead ends: 662 [2019-01-12 15:13:07,110 INFO L226 Difference]: Without dead ends: 431 [2019-01-12 15:13:07,111 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:13:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-01-12 15:13:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-01-12 15:13:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-12 15:13:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-01-12 15:13:07,139 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-01-12 15:13:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:07,139 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-01-12 15:13:07,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-01-12 15:13:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:13:07,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:07,143 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:13:07,143 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-01-12 15:13:07,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:07,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:07,285 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-01-12 15:13:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:07,979 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-01-12 15:13:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:07,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-01-12 15:13:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:07,985 INFO L225 Difference]: With dead ends: 985 [2019-01-12 15:13:07,985 INFO L226 Difference]: Without dead ends: 593 [2019-01-12 15:13:07,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-01-12 15:13:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-01-12 15:13:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-01-12 15:13:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-01-12 15:13:08,027 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-01-12 15:13:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:08,027 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-01-12 15:13:08,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-01-12 15:13:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:13:08,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:08,030 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:13:08,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-01-12 15:13:08,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:08,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:08,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:08,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:08,136 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-01-12 15:13:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:08,532 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-01-12 15:13:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:08,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-12 15:13:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:08,540 INFO L225 Difference]: With dead ends: 1143 [2019-01-12 15:13:08,541 INFO L226 Difference]: Without dead ends: 747 [2019-01-12 15:13:08,542 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:13:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-01-12 15:13:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-01-12 15:13:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-01-12 15:13:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-01-12 15:13:08,609 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-01-12 15:13:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:08,610 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-01-12 15:13:08,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-01-12 15:13:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:13:08,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:08,613 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:13:08,613 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-01-12 15:13:08,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:08,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:08,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:08,883 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-01-12 15:13:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:09,597 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-01-12 15:13:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:09,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-01-12 15:13:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:09,606 INFO L225 Difference]: With dead ends: 1617 [2019-01-12 15:13:09,606 INFO L226 Difference]: Without dead ends: 923 [2019-01-12 15:13:09,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-01-12 15:13:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-01-12 15:13:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-01-12 15:13:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-01-12 15:13:09,684 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-01-12 15:13:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:09,684 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-01-12 15:13:09,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-01-12 15:13:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:13:09,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:09,686 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:13:09,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-01-12 15:13:09,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:09,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:09,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:09,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:09,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:09,824 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-01-12 15:13:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:10,251 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-01-12 15:13:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:10,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-12 15:13:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:10,261 INFO L225 Difference]: With dead ends: 2017 [2019-01-12 15:13:10,261 INFO L226 Difference]: Without dead ends: 1321 [2019-01-12 15:13:10,263 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:13:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-01-12 15:13:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-01-12 15:13:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-01-12 15:13:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-01-12 15:13:10,376 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-01-12 15:13:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:10,377 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-01-12 15:13:10,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-01-12 15:13:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:13:10,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:10,380 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:13:10,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-01-12 15:13:10,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:10,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:10,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:10,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:10,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:10,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:10,507 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-01-12 15:13:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:10,991 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-01-12 15:13:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:10,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 15:13:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:11,005 INFO L225 Difference]: With dead ends: 3670 [2019-01-12 15:13:11,005 INFO L226 Difference]: Without dead ends: 1847 [2019-01-12 15:13:11,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:13:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-01-12 15:13:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-01-12 15:13:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-01-12 15:13:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-01-12 15:13:11,215 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-01-12 15:13:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:11,216 INFO L480 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-01-12 15:13:11,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-01-12 15:13:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:13:11,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:11,222 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:13:11,222 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-01-12 15:13:11,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:11,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 15:13:11,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:11,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:11,313 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-01-12 15:13:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:11,663 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-01-12 15:13:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:11,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-12 15:13:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:11,674 INFO L225 Difference]: With dead ends: 3621 [2019-01-12 15:13:11,674 INFO L226 Difference]: Without dead ends: 1799 [2019-01-12 15:13:11,678 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:13:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-01-12 15:13:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-01-12 15:13:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-01-12 15:13:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-01-12 15:13:11,803 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-01-12 15:13:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:11,804 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-01-12 15:13:11,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-01-12 15:13:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:13:11,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:11,808 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-01-12 15:13:11,808 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-01-12 15:13:11,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:11,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:11,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:13:11,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:11,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:11,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:11,892 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-01-12 15:13:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:12,238 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-01-12 15:13:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:12,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 15:13:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:12,245 INFO L225 Difference]: With dead ends: 3078 [2019-01-12 15:13:12,245 INFO L226 Difference]: Without dead ends: 724 [2019-01-12 15:13:12,250 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:13:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-01-12 15:13:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-01-12 15:13:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-01-12 15:13:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-01-12 15:13:12,328 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-01-12 15:13:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:12,330 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-01-12 15:13:12,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-01-12 15:13:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:13:12,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:12,335 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:13:12,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-01-12 15:13:12,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:12,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:12,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:12,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:12,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:12,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:12,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:12,487 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-01-12 15:13:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:12,733 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-01-12 15:13:12,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:12,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 15:13:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:12,739 INFO L225 Difference]: With dead ends: 1048 [2019-01-12 15:13:12,739 INFO L226 Difference]: Without dead ends: 594 [2019-01-12 15:13:12,740 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:13:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-01-12 15:13:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-01-12 15:13:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-01-12 15:13:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-01-12 15:13:12,795 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-01-12 15:13:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:12,795 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-01-12 15:13:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-01-12 15:13:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:13:12,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:12,799 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:13:12,800 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-01-12 15:13:12,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:13,200 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 15:13:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:13:13,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:13:13,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:13:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:13:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:13:13,218 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-01-12 15:13:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:13,366 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-01-12 15:13:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:13:13,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 15:13:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:13,371 INFO L225 Difference]: With dead ends: 598 [2019-01-12 15:13:13,371 INFO L226 Difference]: Without dead ends: 596 [2019-01-12 15:13:13,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:13:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-01-12 15:13:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-01-12 15:13:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-01-12 15:13:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-01-12 15:13:13,415 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-01-12 15:13:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:13,415 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-01-12 15:13:13,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:13:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-01-12 15:13:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:13,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:13,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:13:13,418 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-01-12 15:13:13,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:13,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 15:13:13,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:13,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:13,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:13,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:13,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:13,506 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-01-12 15:13:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:13,741 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-01-12 15:13:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:13,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 15:13:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:13,747 INFO L225 Difference]: With dead ends: 1230 [2019-01-12 15:13:13,748 INFO L226 Difference]: Without dead ends: 900 [2019-01-12 15:13:13,749 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:13:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-01-12 15:13:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-01-12 15:13:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-01-12 15:13:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-01-12 15:13:13,804 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-01-12 15:13:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:13,805 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-01-12 15:13:13,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-01-12 15:13:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 15:13:13,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:13,808 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:13:13,808 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-01-12 15:13:13,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:13,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:13,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:13:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:13:13,882 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:13:13,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:13:13 BoogieIcfgContainer [2019-01-12 15:13:13,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:13:13,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:13:13,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:13:13,985 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:13:13,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:05" (3/4) ... [2019-01-12 15:13:13,990 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:13:14,147 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:13:14,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:13:14,149 INFO L168 Benchmark]: Toolchain (without parser) took 10567.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 166.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:14,149 INFO L168 Benchmark]: CDTParser took 0.18 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:13:14,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:13:14,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.46 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:13:14,151 INFO L168 Benchmark]: Boogie Preprocessor took 123.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:14,151 INFO L168 Benchmark]: RCFGBuilder took 1183.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:14,153 INFO L168 Benchmark]: TraceAbstraction took 8648.33 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.3 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:14,153 INFO L168 Benchmark]: Witness Printer took 163.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:14,157 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.18 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 385.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 57.46 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1183.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8648.33 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.3 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. * Witness Printer took 163.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. UNSAFE Result, 8.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...