/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:50:04,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:50:04,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:50:04,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:50:04,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:50:04,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:50:04,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:50:04,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:50:04,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:50:04,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:50:04,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:50:04,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:50:04,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:50:04,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:50:04,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:50:04,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:50:04,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:50:04,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:50:04,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:50:04,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:50:04,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:50:04,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:50:04,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:50:04,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:50:04,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:50:04,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:50:04,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:50:04,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:50:04,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:50:04,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:50:04,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:50:04,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:50:04,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:50:04,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:50:04,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:50:04,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:50:04,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:50:04,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:50:04,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:50:04,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:50:04,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:50:04,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:50:04,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:50:04,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:50:04,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:50:04,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:50:04,704 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:50:04,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:50:04,704 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:50:04,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:50:04,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:50:04,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:50:04,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:50:04,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:50:04,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:50:04,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:50:04,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:50:04,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:50:04,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:50:04,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:50:04,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:50:04,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:50:04,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:50:04,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:50:04,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:04,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:50:04,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:50:04,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:50:04,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:50:04,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:50:04,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:50:04,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:50:04,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:50:04,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:50:05,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:50:05,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:50:05,002 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:50:05,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-11-23 22:50:05,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9141d9de5/e11a56510b9f4b5292a2df8cd427fde8/FLAG9d0aa9010 [2019-11-23 22:50:05,548 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:50:05,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-11-23 22:50:05,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9141d9de5/e11a56510b9f4b5292a2df8cd427fde8/FLAG9d0aa9010 [2019-11-23 22:50:05,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9141d9de5/e11a56510b9f4b5292a2df8cd427fde8 [2019-11-23 22:50:05,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:50:05,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:50:05,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:05,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:50:05,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:50:05,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:05" (1/1) ... [2019-11-23 22:50:05,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff2f9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:05, skipping insertion in model container [2019-11-23 22:50:05,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:05" (1/1) ... [2019-11-23 22:50:05,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:50:06,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:50:06,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:06,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:50:06,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:06,402 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:50:06,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06 WrapperNode [2019-11-23 22:50:06,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:06,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:06,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:50:06,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:50:06,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:06,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:50:06,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:50:06,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:50:06,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... [2019-11-23 22:50:06,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:50:06,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:50:06,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:50:06,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:50:06,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:50:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:50:07,095 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:50:07,096 INFO L284 CfgBuilder]: Removed 73 assume(true) statements. [2019-11-23 22:50:07,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:07 BoogieIcfgContainer [2019-11-23 22:50:07,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:50:07,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:50:07,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:50:07,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:50:07,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:50:05" (1/3) ... [2019-11-23 22:50:07,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b18966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:07, skipping insertion in model container [2019-11-23 22:50:07,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:06" (2/3) ... [2019-11-23 22:50:07,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b18966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:07, skipping insertion in model container [2019-11-23 22:50:07,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:07" (3/3) ... [2019-11-23 22:50:07,110 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-23 22:50:07,120 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:50:07,128 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:50:07,140 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:50:07,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:50:07,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:50:07,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:50:07,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:50:07,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:50:07,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:50:07,168 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:50:07,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:50:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-23 22:50:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:50:07,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:07,193 INFO L410 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] [2019-11-23 22:50:07,194 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-11-23 22:50:07,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:07,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555909457] [2019-11-23 22:50:07,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:07,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555909457] [2019-11-23 22:50:07,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:07,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:07,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443675979] [2019-11-23 22:50:07,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:07,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,376 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-23 22:50:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:07,448 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-11-23 22:50:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:07,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:50:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:07,462 INFO L225 Difference]: With dead ends: 239 [2019-11-23 22:50:07,462 INFO L226 Difference]: Without dead ends: 118 [2019-11-23 22:50:07,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-23 22:50:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-23 22:50:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-23 22:50:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-11-23 22:50:07,520 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-11-23 22:50:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:07,520 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-11-23 22:50:07,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-11-23 22:50:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:50:07,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:07,525 INFO L410 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] [2019-11-23 22:50:07,526 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-11-23 22:50:07,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:07,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736796510] [2019-11-23 22:50:07,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:07,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736796510] [2019-11-23 22:50:07,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:07,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:07,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258034726] [2019-11-23 22:50:07,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:07,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,593 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-11-23 22:50:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:07,682 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-11-23 22:50:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:07,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:50:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:07,685 INFO L225 Difference]: With dead ends: 308 [2019-11-23 22:50:07,686 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:50:07,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:50:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-11-23 22:50:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-23 22:50:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-11-23 22:50:07,718 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-11-23 22:50:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:07,718 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-11-23 22:50:07,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-11-23 22:50:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:50:07,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:07,720 INFO L410 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] [2019-11-23 22:50:07,721 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-11-23 22:50:07,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:07,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381607744] [2019-11-23 22:50:07,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:07,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381607744] [2019-11-23 22:50:07,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:07,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:07,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179360467] [2019-11-23 22:50:07,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:07,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,771 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-11-23 22:50:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:07,820 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-11-23 22:50:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:07,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:50:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:07,823 INFO L225 Difference]: With dead ends: 381 [2019-11-23 22:50:07,823 INFO L226 Difference]: Without dead ends: 194 [2019-11-23 22:50:07,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-23 22:50:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-23 22:50:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-23 22:50:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-23 22:50:07,859 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-11-23 22:50:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:07,859 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-23 22:50:07,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-23 22:50:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:50:07,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:07,864 INFO L410 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] [2019-11-23 22:50:07,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-11-23 22:50:07,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:07,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866109095] [2019-11-23 22:50:07,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:07,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866109095] [2019-11-23 22:50:07,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:07,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:07,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096047790] [2019-11-23 22:50:07,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:07,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,943 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-11-23 22:50:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:07,991 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-11-23 22:50:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:07,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:50:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:07,993 INFO L225 Difference]: With dead ends: 380 [2019-11-23 22:50:07,993 INFO L226 Difference]: Without dead ends: 194 [2019-11-23 22:50:07,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-23 22:50:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-23 22:50:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-23 22:50:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-11-23 22:50:08,010 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-11-23 22:50:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,010 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-11-23 22:50:08,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-11-23 22:50:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:50:08,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,012 INFO L410 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] [2019-11-23 22:50:08,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-11-23 22:50:08,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400873665] [2019-11-23 22:50:08,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:08,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400873665] [2019-11-23 22:50:08,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:08,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377343131] [2019-11-23 22:50:08,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:08,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,068 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-11-23 22:50:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:08,131 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-11-23 22:50:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:08,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:50:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:08,134 INFO L225 Difference]: With dead ends: 525 [2019-11-23 22:50:08,134 INFO L226 Difference]: Without dead ends: 356 [2019-11-23 22:50:08,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-23 22:50:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-11-23 22:50:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:50:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-11-23 22:50:08,167 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-11-23 22:50:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,167 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-11-23 22:50:08,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-11-23 22:50:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:50:08,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,176 INFO L410 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] [2019-11-23 22:50:08,176 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-11-23 22:50:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682978430] [2019-11-23 22:50:08,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:08,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682978430] [2019-11-23 22:50:08,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:08,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:08,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309385042] [2019-11-23 22:50:08,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:08,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:08,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,239 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-11-23 22:50:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:08,296 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-11-23 22:50:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:08,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-23 22:50:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:08,300 INFO L225 Difference]: With dead ends: 910 [2019-11-23 22:50:08,300 INFO L226 Difference]: Without dead ends: 606 [2019-11-23 22:50:08,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-23 22:50:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-23 22:50:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-23 22:50:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-11-23 22:50:08,332 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-11-23 22:50:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,332 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-11-23 22:50:08,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-23 22:50:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:50:08,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,336 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:08,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-11-23 22:50:08,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747980711] [2019-11-23 22:50:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:08,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747980711] [2019-11-23 22:50:08,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:08,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:08,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565183205] [2019-11-23 22:50:08,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:08,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,411 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-11-23 22:50:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:08,492 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-11-23 22:50:08,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:08,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-23 22:50:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:08,497 INFO L225 Difference]: With dead ends: 1152 [2019-11-23 22:50:08,497 INFO L226 Difference]: Without dead ends: 864 [2019-11-23 22:50:08,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-23 22:50:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-11-23 22:50:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-23 22:50:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-11-23 22:50:08,546 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-11-23 22:50:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,547 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-11-23 22:50:08,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-11-23 22:50:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:50:08,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,549 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:08,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-11-23 22:50:08,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40709378] [2019-11-23 22:50:08,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:50:08,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40709378] [2019-11-23 22:50:08,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:08,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:50:08,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268136379] [2019-11-23 22:50:08,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:50:08,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:50:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:50:08,669 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-11-23 22:50:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:08,881 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-11-23 22:50:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:50:08,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-23 22:50:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:08,891 INFO L225 Difference]: With dead ends: 2777 [2019-11-23 22:50:08,891 INFO L226 Difference]: Without dead ends: 1948 [2019-11-23 22:50:08,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:50:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-11-23 22:50:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-11-23 22:50:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-23 22:50:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-11-23 22:50:08,963 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-11-23 22:50:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,963 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-11-23 22:50:08,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:50:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-11-23 22:50:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:50:08,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,965 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:08,965 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-11-23 22:50:08,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886017627] [2019-11-23 22:50:08,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:50:09,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886017627] [2019-11-23 22:50:09,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:50:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072711337] [2019-11-23 22:50:09,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:50:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:50:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:50:09,045 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-11-23 22:50:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:09,252 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-11-23 22:50:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:50:09,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-23 22:50:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:09,262 INFO L225 Difference]: With dead ends: 2232 [2019-11-23 22:50:09,262 INFO L226 Difference]: Without dead ends: 1361 [2019-11-23 22:50:09,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:50:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-23 22:50:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-11-23 22:50:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-23 22:50:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-11-23 22:50:09,369 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-11-23 22:50:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:09,370 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-11-23 22:50:09,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:50:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-11-23 22:50:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:50:09,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:09,372 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:09,373 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-11-23 22:50:09,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:09,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770831307] [2019-11-23 22:50:09,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:50:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:50:09,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:50:09,492 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:50:09,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:50:09 BoogieIcfgContainer [2019-11-23 22:50:09,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:50:09,608 INFO L168 Benchmark]: Toolchain (without parser) took 3644.35 ms. Allocated memory was 145.2 MB in the beginning and 245.4 MB in the end (delta: 100.1 MB). Free memory was 101.9 MB in the beginning and 167.7 MB in the end (delta: -65.8 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,609 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.38 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 180.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.25 ms. Allocated memory is still 202.4 MB. Free memory was 180.3 MB in the beginning and 177.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,615 INFO L168 Benchmark]: Boogie Preprocessor took 34.25 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,616 INFO L168 Benchmark]: RCFGBuilder took 608.70 ms. Allocated memory is still 202.4 MB. Free memory was 175.7 MB in the beginning and 142.0 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,618 INFO L168 Benchmark]: TraceAbstraction took 2504.99 ms. Allocated memory was 202.4 MB in the beginning and 245.4 MB in the end (delta: 43.0 MB). Free memory was 142.0 MB in the beginning and 167.7 MB in the end (delta: -25.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:09,626 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.38 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 180.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.25 ms. Allocated memory is still 202.4 MB. Free memory was 180.3 MB in the beginning and 177.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.25 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 608.70 ms. Allocated memory is still 202.4 MB. Free memory was 175.7 MB in the beginning and 142.0 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2504.99 ms. Allocated memory was 202.4 MB in the beginning and 245.4 MB in the end (delta: 43.0 MB). Free memory was 142.0 MB in the beginning and 167.7 MB in the end (delta: -25.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 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 m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [E_1=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] [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 VAL [E_1=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] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=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] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [E_1=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] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=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] [L240] COND FALSE !(M_E == 0) VAL [E_1=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] [L245] COND FALSE !(T1_E == 0) VAL [E_1=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] [L250] COND FALSE !(E_1 == 0) VAL [E_1=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] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=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] [L105] COND FALSE !(m_pc == 1) VAL [E_1=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] [L115] __retres1 = 0 VAL [E_1=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] [L117] return (__retres1); VAL [E_1=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=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] [L121] int __retres1 ; VAL [E_1=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] [L124] COND FALSE !(t1_pc == 1) VAL [E_1=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] [L134] __retres1 = 0 VAL [E_1=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] [L136] return (__retres1); VAL [E_1=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] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [E_1=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] [L263] COND FALSE !(M_E == 1) VAL [E_1=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] [L268] COND FALSE !(T1_E == 1) VAL [E_1=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] [L273] COND FALSE !(E_1 == 1) VAL [E_1=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] [L394] COND TRUE 1 VAL [E_1=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] [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=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] [L191] COND TRUE 1 VAL [E_1=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] [L166] int __retres1 ; VAL [E_1=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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=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] [L182] return (__retres1); VAL [E_1=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] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=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] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=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] [L72] COND TRUE t1_pc == 0 VAL [E_1=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] [L83] COND TRUE 1 VAL [E_1=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] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=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] [L191] COND TRUE 1 VAL [E_1=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] [L166] int __retres1 ; VAL [E_1=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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=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] [L182] return (__retres1); VAL [E_1=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] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=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] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=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] [L31] COND TRUE m_pc == 0 VAL [E_1=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] [L42] COND TRUE 1 VAL [E_1=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] [L45] E_1 = 1 [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=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] [L50] COND TRUE 1 VAL [E_1=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] [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=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] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=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] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=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] [L75] COND TRUE t1_pc == 1 VAL [E_1=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] [L11] __VERIFIER_error() VAL [E_1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1554 SDtfs, 1693 SDslu, 1435 SDs, 0 SdLazy, 165 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 28171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...