./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c244c639ec9718adcbacffa967b748c52a23cd0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:19:23,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:19:23,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:19:23,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:19:23,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:19:23,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:19:23,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:19:23,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:19:23,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:19:23,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:19:23,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:19:23,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:19:23,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:19:23,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:19:23,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:19:23,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:19:23,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:19:23,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:19:23,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:19:23,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:19:23,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:19:23,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:19:23,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:19:23,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:19:23,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:19:23,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:19:23,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:19:23,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:19:23,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:19:23,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:19:23,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:19:23,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:19:23,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:19:23,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:19:23,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:19:23,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:19:23,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:19:23,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:19:23,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:19:23,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:19:23,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:19:23,512 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:19:23,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:19:23,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:19:23,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:19:23,514 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:19:23,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:19:23,514 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:19:23,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:19:23,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:19:23,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:19:23,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:19:23,515 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:19:23,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:19:23,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:19:23,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:19:23,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:19:23,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:19:23,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:19:23,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:19:23,516 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c244c639ec9718adcbacffa967b748c52a23cd0 [2018-12-31 10:19:23,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:19:23,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:19:23,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:19:23,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:19:23,599 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:19:23,600 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c [2018-12-31 10:19:23,666 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5cb2301/20e6e2fca762494396b6d927e900ae4f/FLAG5cbbddd09 [2018-12-31 10:19:24,222 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:19:24,223 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/transmitter.02_false-unreach-call_false-termination.cil.c [2018-12-31 10:19:24,233 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5cb2301/20e6e2fca762494396b6d927e900ae4f/FLAG5cbbddd09 [2018-12-31 10:19:24,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5cb2301/20e6e2fca762494396b6d927e900ae4f [2018-12-31 10:19:24,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:19:24,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:19:24,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:19:24,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:19:24,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:19:24,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:19:24" (1/1) ... [2018-12-31 10:19:24,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64904782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:24, skipping insertion in model container [2018-12-31 10:19:24,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:19:24" (1/1) ... [2018-12-31 10:19:24,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:19:24,622 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:19:24,936 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:19:24,952 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:19:25,035 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:19:25,067 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:19:25,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25 WrapperNode [2018-12-31 10:19:25,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:19:25,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:19:25,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:19:25,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:19:25,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:19:25,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:19:25,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:19:25,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:19:25,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... [2018-12-31 10:19:25,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:19:25,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:19:25,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:19:25,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:19:25,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:19:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:19:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:19:26,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:19:26,780 INFO L280 CfgBuilder]: Removed 94 assue(true) statements. [2018-12-31 10:19:26,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:26 BoogieIcfgContainer [2018-12-31 10:19:26,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:19:26,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:19:26,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:19:26,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:19:26,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:19:24" (1/3) ... [2018-12-31 10:19:26,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae7f7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:19:26, skipping insertion in model container [2018-12-31 10:19:26,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:25" (2/3) ... [2018-12-31 10:19:26,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae7f7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:19:26, skipping insertion in model container [2018-12-31 10:19:26,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:26" (3/3) ... [2018-12-31 10:19:26,789 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02_false-unreach-call_false-termination.cil.c [2018-12-31 10:19:26,799 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:19:26,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:19:26,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:19:26,859 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:19:26,860 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:19:26,861 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:19:26,861 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:19:26,861 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:19:26,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:19:26,861 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:19:26,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:19:26,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:19:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-12-31 10:19:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:26,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:26,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:26,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2018-12-31 10:19:26,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:26,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:26,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:26,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:27,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:27,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:27,155 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2018-12-31 10:19:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:27,244 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2018-12-31 10:19:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:27,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:27,264 INFO L225 Difference]: With dead ends: 379 [2018-12-31 10:19:27,265 INFO L226 Difference]: Without dead ends: 188 [2018-12-31 10:19:27,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-31 10:19:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-31 10:19:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-31 10:19:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2018-12-31 10:19:27,344 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2018-12-31 10:19:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:27,347 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2018-12-31 10:19:27,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2018-12-31 10:19:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:27,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:27,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:27,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2018-12-31 10:19:27,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:27,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:27,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:27,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:27,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:27,425 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2018-12-31 10:19:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:27,625 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2018-12-31 10:19:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:27,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:27,630 INFO L225 Difference]: With dead ends: 498 [2018-12-31 10:19:27,630 INFO L226 Difference]: Without dead ends: 317 [2018-12-31 10:19:27,633 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 [2018-12-31 10:19:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-31 10:19:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-12-31 10:19:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-31 10:19:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2018-12-31 10:19:27,667 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2018-12-31 10:19:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:27,668 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2018-12-31 10:19:27,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2018-12-31 10:19:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:27,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:27,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:27,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2018-12-31 10:19:27,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:27,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:27,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:27,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:27,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:27,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:27,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:27,748 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2018-12-31 10:19:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:27,829 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2018-12-31 10:19:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:27,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:27,837 INFO L225 Difference]: With dead ends: 622 [2018-12-31 10:19:27,840 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 10:19:27,846 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 [2018-12-31 10:19:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 10:19:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-31 10:19:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-31 10:19:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2018-12-31 10:19:27,886 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2018-12-31 10:19:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:27,887 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2018-12-31 10:19:27,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2018-12-31 10:19:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:27,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:27,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:27,890 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2018-12-31 10:19:27,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:27,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:27,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:27,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:27,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:27,965 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2018-12-31 10:19:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:28,064 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2018-12-31 10:19:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:28,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:28,068 INFO L225 Difference]: With dead ends: 621 [2018-12-31 10:19:28,068 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 10:19:28,070 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 [2018-12-31 10:19:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 10:19:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-31 10:19:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-31 10:19:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2018-12-31 10:19:28,093 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2018-12-31 10:19:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:28,093 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2018-12-31 10:19:28,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2018-12-31 10:19:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:28,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:28,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:28,097 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2018-12-31 10:19:28,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:28,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:28,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:28,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:28,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:28,172 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2018-12-31 10:19:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:28,351 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2018-12-31 10:19:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:28,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:28,358 INFO L225 Difference]: With dead ends: 620 [2018-12-31 10:19:28,358 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 10:19:28,360 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 [2018-12-31 10:19:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 10:19:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-31 10:19:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-31 10:19:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2018-12-31 10:19:28,382 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2018-12-31 10:19:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:28,383 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2018-12-31 10:19:28,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2018-12-31 10:19:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:28,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:28,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:28,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2018-12-31 10:19:28,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:28,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:28,474 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2018-12-31 10:19:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:28,740 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2018-12-31 10:19:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:28,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:28,745 INFO L225 Difference]: With dead ends: 619 [2018-12-31 10:19:28,746 INFO L226 Difference]: Without dead ends: 315 [2018-12-31 10:19:28,747 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 [2018-12-31 10:19:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-31 10:19:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-31 10:19:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-31 10:19:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2018-12-31 10:19:28,768 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2018-12-31 10:19:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:28,768 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2018-12-31 10:19:28,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2018-12-31 10:19:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 10:19:28,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:28,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:28,770 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2018-12-31 10:19:28,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:28,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:28,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:28,846 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 3 states. [2018-12-31 10:19:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:29,266 INFO L93 Difference]: Finished difference Result 870 states and 1162 transitions. [2018-12-31 10:19:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:29,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 10:19:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:29,272 INFO L225 Difference]: With dead ends: 870 [2018-12-31 10:19:29,273 INFO L226 Difference]: Without dead ends: 592 [2018-12-31 10:19:29,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-12-31 10:19:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 556. [2018-12-31 10:19:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-31 10:19:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2018-12-31 10:19:29,319 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 49 [2018-12-31 10:19:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:29,319 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2018-12-31 10:19:29,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2018-12-31 10:19:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 10:19:29,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:29,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:29,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -397727545, now seen corresponding path program 1 times [2018-12-31 10:19:29,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:29,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:29,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:29,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:29,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:29,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:29,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:29,453 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand 3 states. [2018-12-31 10:19:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:29,875 INFO L93 Difference]: Finished difference Result 1454 states and 1913 transitions. [2018-12-31 10:19:29,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:29,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 10:19:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:29,882 INFO L225 Difference]: With dead ends: 1454 [2018-12-31 10:19:29,882 INFO L226 Difference]: Without dead ends: 968 [2018-12-31 10:19:29,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-12-31 10:19:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2018-12-31 10:19:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-12-31 10:19:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1204 transitions. [2018-12-31 10:19:29,943 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1204 transitions. Word has length 50 [2018-12-31 10:19:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:29,944 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1204 transitions. [2018-12-31 10:19:29,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1204 transitions. [2018-12-31 10:19:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 10:19:29,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:29,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:29,946 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 765911831, now seen corresponding path program 1 times [2018-12-31 10:19:29,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:29,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:29,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:30,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:19:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:30,070 INFO L87 Difference]: Start difference. First operand 926 states and 1204 transitions. Second operand 3 states. [2018-12-31 10:19:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:30,474 INFO L93 Difference]: Finished difference Result 2626 states and 3421 transitions. [2018-12-31 10:19:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:30,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 10:19:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:30,485 INFO L225 Difference]: With dead ends: 2626 [2018-12-31 10:19:30,485 INFO L226 Difference]: Without dead ends: 1750 [2018-12-31 10:19:30,487 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 [2018-12-31 10:19:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2018-12-31 10:19:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1734. [2018-12-31 10:19:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2018-12-31 10:19:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2234 transitions. [2018-12-31 10:19:30,628 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2234 transitions. Word has length 51 [2018-12-31 10:19:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:30,631 INFO L480 AbstractCegarLoop]: Abstraction has 1734 states and 2234 transitions. [2018-12-31 10:19:30,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2234 transitions. [2018-12-31 10:19:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 10:19:30,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:30,633 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:30,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1533277321, now seen corresponding path program 1 times [2018-12-31 10:19:30,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:30,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:30,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:30,738 INFO L87 Difference]: Start difference. First operand 1734 states and 2234 transitions. Second operand 3 states. [2018-12-31 10:19:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:31,278 INFO L93 Difference]: Finished difference Result 5068 states and 6521 transitions. [2018-12-31 10:19:31,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:31,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 10:19:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:31,298 INFO L225 Difference]: With dead ends: 5068 [2018-12-31 10:19:31,298 INFO L226 Difference]: Without dead ends: 3402 [2018-12-31 10:19:31,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-12-31 10:19:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2018-12-31 10:19:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2018-12-31 10:19:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4340 transitions. [2018-12-31 10:19:31,484 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4340 transitions. Word has length 66 [2018-12-31 10:19:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:31,485 INFO L480 AbstractCegarLoop]: Abstraction has 3402 states and 4340 transitions. [2018-12-31 10:19:31,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4340 transitions. [2018-12-31 10:19:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 10:19:31,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:31,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:31,491 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -883662481, now seen corresponding path program 1 times [2018-12-31 10:19:31,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:31,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:31,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:19:31,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:31,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:19:31,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:19:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:19:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:19:31,759 INFO L87 Difference]: Start difference. First operand 3402 states and 4340 transitions. Second operand 5 states. [2018-12-31 10:19:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:33,286 INFO L93 Difference]: Finished difference Result 10802 states and 13699 transitions. [2018-12-31 10:19:33,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:19:33,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-31 10:19:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:33,328 INFO L225 Difference]: With dead ends: 10802 [2018-12-31 10:19:33,328 INFO L226 Difference]: Without dead ends: 7492 [2018-12-31 10:19:33,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:19:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-12-31 10:19:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 3546. [2018-12-31 10:19:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2018-12-31 10:19:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4448 transitions. [2018-12-31 10:19:33,746 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4448 transitions. Word has length 89 [2018-12-31 10:19:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:33,746 INFO L480 AbstractCegarLoop]: Abstraction has 3546 states and 4448 transitions. [2018-12-31 10:19:33,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:19:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4448 transitions. [2018-12-31 10:19:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 10:19:33,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:33,752 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:33,752 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -305176077, now seen corresponding path program 1 times [2018-12-31 10:19:33,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:19:33,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:33,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:33,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:33,841 INFO L87 Difference]: Start difference. First operand 3546 states and 4448 transitions. Second operand 3 states. [2018-12-31 10:19:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:34,685 INFO L93 Difference]: Finished difference Result 10194 states and 12806 transitions. [2018-12-31 10:19:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:34,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-31 10:19:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:34,726 INFO L225 Difference]: With dead ends: 10194 [2018-12-31 10:19:34,726 INFO L226 Difference]: Without dead ends: 6712 [2018-12-31 10:19:34,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2018-12-31 10:19:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6494. [2018-12-31 10:19:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2018-12-31 10:19:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8084 transitions. [2018-12-31 10:19:35,239 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8084 transitions. Word has length 89 [2018-12-31 10:19:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:35,240 INFO L480 AbstractCegarLoop]: Abstraction has 6494 states and 8084 transitions. [2018-12-31 10:19:35,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8084 transitions. [2018-12-31 10:19:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 10:19:35,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:35,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:35,247 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1278665036, now seen corresponding path program 1 times [2018-12-31 10:19:35,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:35,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:19:35,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:35,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:19:35,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:19:35,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:19:35,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:19:35,521 INFO L87 Difference]: Start difference. First operand 6494 states and 8084 transitions. Second operand 5 states. [2018-12-31 10:19:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:37,106 INFO L93 Difference]: Finished difference Result 15348 states and 19199 transitions. [2018-12-31 10:19:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:19:37,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-31 10:19:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:37,168 INFO L225 Difference]: With dead ends: 15348 [2018-12-31 10:19:37,168 INFO L226 Difference]: Without dead ends: 8934 [2018-12-31 10:19:37,182 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 [2018-12-31 10:19:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2018-12-31 10:19:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 6542. [2018-12-31 10:19:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2018-12-31 10:19:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8000 transitions. [2018-12-31 10:19:37,735 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8000 transitions. Word has length 89 [2018-12-31 10:19:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:37,735 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 8000 transitions. [2018-12-31 10:19:37,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:19:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8000 transitions. [2018-12-31 10:19:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 10:19:37,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:37,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:37,740 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash 211800632, now seen corresponding path program 1 times [2018-12-31 10:19:37,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:37,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:37,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:37,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:37,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:37,843 INFO L87 Difference]: Start difference. First operand 6542 states and 8000 transitions. Second operand 3 states. [2018-12-31 10:19:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:38,540 INFO L93 Difference]: Finished difference Result 9812 states and 12049 transitions. [2018-12-31 10:19:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:38,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-31 10:19:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:38,570 INFO L225 Difference]: With dead ends: 9812 [2018-12-31 10:19:38,570 INFO L226 Difference]: Without dead ends: 6542 [2018-12-31 10:19:38,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2018-12-31 10:19:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 6512. [2018-12-31 10:19:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2018-12-31 10:19:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7866 transitions. [2018-12-31 10:19:39,018 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7866 transitions. Word has length 89 [2018-12-31 10:19:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:39,018 INFO L480 AbstractCegarLoop]: Abstraction has 6512 states and 7866 transitions. [2018-12-31 10:19:39,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7866 transitions. [2018-12-31 10:19:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 10:19:39,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:39,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:39,026 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash -974468191, now seen corresponding path program 1 times [2018-12-31 10:19:39,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:39,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:39,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:19:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:19:39,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:19:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:19:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:19:39,276 INFO L87 Difference]: Start difference. First operand 6512 states and 7866 transitions. Second operand 5 states. [2018-12-31 10:19:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:40,335 INFO L93 Difference]: Finished difference Result 12634 states and 15323 transitions. [2018-12-31 10:19:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:19:40,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-31 10:19:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:40,350 INFO L225 Difference]: With dead ends: 12634 [2018-12-31 10:19:40,350 INFO L226 Difference]: Without dead ends: 6178 [2018-12-31 10:19:40,362 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 [2018-12-31 10:19:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2018-12-31 10:19:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4920. [2018-12-31 10:19:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2018-12-31 10:19:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5854 transitions. [2018-12-31 10:19:40,736 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5854 transitions. Word has length 90 [2018-12-31 10:19:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 4920 states and 5854 transitions. [2018-12-31 10:19:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:19:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5854 transitions. [2018-12-31 10:19:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 10:19:40,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:40,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:40,740 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2018-12-31 10:19:40,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:40,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:40,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:40,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:40,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:40,835 INFO L87 Difference]: Start difference. First operand 4920 states and 5854 transitions. Second operand 3 states. [2018-12-31 10:19:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:41,241 INFO L93 Difference]: Finished difference Result 9778 states and 11642 transitions. [2018-12-31 10:19:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:41,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-31 10:19:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:41,250 INFO L225 Difference]: With dead ends: 9778 [2018-12-31 10:19:41,250 INFO L226 Difference]: Without dead ends: 4190 [2018-12-31 10:19:41,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2018-12-31 10:19:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4186. [2018-12-31 10:19:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2018-12-31 10:19:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4930 transitions. [2018-12-31 10:19:41,575 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4930 transitions. Word has length 92 [2018-12-31 10:19:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:41,576 INFO L480 AbstractCegarLoop]: Abstraction has 4186 states and 4930 transitions. [2018-12-31 10:19:41,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4930 transitions. [2018-12-31 10:19:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-31 10:19:41,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:41,579 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:41,579 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2018-12-31 10:19:41,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:19:41,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:41,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:41,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:41,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:41,670 INFO L87 Difference]: Start difference. First operand 4186 states and 4930 transitions. Second operand 3 states. [2018-12-31 10:19:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:42,061 INFO L93 Difference]: Finished difference Result 8752 states and 10233 transitions. [2018-12-31 10:19:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:42,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-31 10:19:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:42,069 INFO L225 Difference]: With dead ends: 8752 [2018-12-31 10:19:42,069 INFO L226 Difference]: Without dead ends: 2868 [2018-12-31 10:19:42,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2018-12-31 10:19:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2790. [2018-12-31 10:19:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2018-12-31 10:19:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3146 transitions. [2018-12-31 10:19:42,282 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3146 transitions. Word has length 116 [2018-12-31 10:19:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:42,282 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 3146 transitions. [2018-12-31 10:19:42,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3146 transitions. [2018-12-31 10:19:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:19:42,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:42,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:42,287 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2018-12-31 10:19:42,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:42,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:42,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:42,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:19:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:19:42,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:19:42,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:19:42,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:19:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:19:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:42,405 INFO L87 Difference]: Start difference. First operand 2790 states and 3146 transitions. Second operand 3 states. [2018-12-31 10:19:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:19:42,696 INFO L93 Difference]: Finished difference Result 3172 states and 3583 transitions. [2018-12-31 10:19:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:19:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-31 10:19:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:19:42,701 INFO L225 Difference]: With dead ends: 3172 [2018-12-31 10:19:42,702 INFO L226 Difference]: Without dead ends: 2470 [2018-12-31 10:19:42,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:19:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2018-12-31 10:19:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2018-12-31 10:19:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2018-12-31 10:19:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2766 transitions. [2018-12-31 10:19:42,898 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2766 transitions. Word has length 117 [2018-12-31 10:19:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:19:42,899 INFO L480 AbstractCegarLoop]: Abstraction has 2470 states and 2766 transitions. [2018-12-31 10:19:42,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:19:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2766 transitions. [2018-12-31 10:19:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 10:19:42,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:19:42,903 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:19:42,903 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:19:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:19:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2018-12-31 10:19:42,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:19:42,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:19:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:42,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:19:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:19:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:19:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:19:42,982 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:19:43,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:19:43 BoogieIcfgContainer [2018-12-31 10:19:43,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:19:43,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:19:43,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:19:43,132 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:19:43,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:26" (3/4) ... [2018-12-31 10:19:43,140 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:19:43,306 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:19:43,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:19:43,308 INFO L168 Benchmark]: Toolchain (without parser) took 18766.14 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 717.8 MB). Free memory was 954.1 MB in the beginning and 1.3 GB in the end (delta: -307.6 MB). Peak memory consumption was 410.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,309 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:19:43,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.92 ms. Allocated memory is still 1.0 GB. Free memory was 954.1 MB in the beginning and 936.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.41 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. [2018-12-31 10:19:43,310 INFO L168 Benchmark]: Boogie Preprocessor took 132.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,312 INFO L168 Benchmark]: RCFGBuilder took 1486.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,312 INFO L168 Benchmark]: TraceAbstraction took 16350.35 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 587.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -206.7 MB). Peak memory consumption was 380.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,313 INFO L168 Benchmark]: Witness Printer took 174.53 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-31 10:19:43,316 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 524.92 ms. Allocated memory is still 1.0 GB. Free memory was 954.1 MB in the beginning and 936.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.41 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 132.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1486.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16350.35 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 587.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -206.7 MB). Peak memory consumption was 380.5 MB. Max. memory is 11.5 GB. * Witness Printer took 174.53 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. UNSAFE Result, 16.2s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5274 SDtfs, 4949 SDslu, 4000 SDs, 0 SdLazy, 329 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6542occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 8022 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 148665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 126/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...