java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:42:00,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:42:00,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:42:00,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:42:00,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:42:00,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:42:00,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:42:00,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:42:00,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:42:00,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:42:00,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:42:00,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:42:00,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:42:00,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:42:00,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:42:00,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:42:00,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:42:00,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:42:00,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:42:00,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:42:00,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:42:00,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:42:00,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:42:00,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:42:00,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:42:00,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:42:00,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:42:00,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:42:00,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:42:00,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:42:00,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:42:00,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:42:00,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:42:00,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:42:00,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:42:00,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:42:00,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:42:00,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:42:00,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:42:00,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:42:00,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:42:00,403 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-10-14 23:42:00,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:42:00,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:42:00,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:42:00,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:42:00,441 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:42:00,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:42:00,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:42:00,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:42:00,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:42:00,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:42:00,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:42:00,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:42:00,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:42:00,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:42:00,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:42:00,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:42:00,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:42:00,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:42:00,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:42:00,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:42:00,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:42:00,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:42:00,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:42:00,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:42:00,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:42:00,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:42:00,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:42:00,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:42:00,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:42:00,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:42:00,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:42:00,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:42:00,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:42:00,742 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:42:00,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-10-14 23:42:00,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fad05ad/ba1eaa57e2fd4ddeabeb8861a9141e8e/FLAGbcabc82a8 [2019-10-14 23:42:01,297 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:42:01,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-10-14 23:42:01,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fad05ad/ba1eaa57e2fd4ddeabeb8861a9141e8e/FLAGbcabc82a8 [2019-10-14 23:42:01,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fad05ad/ba1eaa57e2fd4ddeabeb8861a9141e8e [2019-10-14 23:42:01,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:42:01,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:42:01,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:42:01,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:42:01,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:42:01,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:01" (1/1) ... [2019-10-14 23:42:01,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c32c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:01, skipping insertion in model container [2019-10-14 23:42:01,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:01" (1/1) ... [2019-10-14 23:42:01,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:42:01,731 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:42:01,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:42:01,966 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:42:02,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:42:02,127 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:42:02,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02 WrapperNode [2019-10-14 23:42:02,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:42:02,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:42:02,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:42:02,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:42:02,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (1/1) ... [2019-10-14 23:42:02,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:42:02,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:42:02,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:42:02,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:42:02,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (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-10-14 23:42:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:42:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:42:02,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:42:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:42:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:42:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:42:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:42:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:42:02,707 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:42:02,708 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-14 23:42:02,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:02 BoogieIcfgContainer [2019-10-14 23:42:02,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:42:02,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:42:02,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:42:02,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:42:02,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:42:01" (1/3) ... [2019-10-14 23:42:02,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abb16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:02, skipping insertion in model container [2019-10-14 23:42:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:02" (2/3) ... [2019-10-14 23:42:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abb16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:02, skipping insertion in model container [2019-10-14 23:42:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:02" (3/3) ... [2019-10-14 23:42:02,718 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-10-14 23:42:02,728 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:42:02,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:42:02,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:42:02,777 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:42:02,778 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:42:02,778 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:42:02,778 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:42:02,778 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:42:02,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:42:02,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:42:02,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:42:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-14 23:42:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:42:02,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:02,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:02,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -105811556, now seen corresponding path program 1 times [2019-10-14 23:42:02,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:02,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393750614] [2019-10-14 23:42:02,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:02,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:02,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:42:03,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393750614] [2019-10-14 23:42:03,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:03,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:42:03,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25141469] [2019-10-14 23:42:03,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:42:03,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:42:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:42:03,032 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-10-14 23:42:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:03,105 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2019-10-14 23:42:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:42:03,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 23:42:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:03,121 INFO L225 Difference]: With dead ends: 160 [2019-10-14 23:42:03,121 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:42:03,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-14 23:42:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:42:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-14 23:42:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-14 23:42:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2019-10-14 23:42:03,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2019-10-14 23:42:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:03,178 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2019-10-14 23:42:03,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:42:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2019-10-14 23:42:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:42:03,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:03,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:03,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1547300989, now seen corresponding path program 1 times [2019-10-14 23:42:03,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:03,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851609153] [2019-10-14 23:42:03,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:42:03,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851609153] [2019-10-14 23:42:03,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:03,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:03,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175894494] [2019-10-14 23:42:03,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:03,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:03,267 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 4 states. [2019-10-14 23:42:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:03,599 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2019-10-14 23:42:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:03,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 23:42:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:03,601 INFO L225 Difference]: With dead ends: 153 [2019-10-14 23:42:03,601 INFO L226 Difference]: Without dead ends: 81 [2019-10-14 23:42:03,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-14 23:42:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-14 23:42:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 23:42:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-10-14 23:42:03,614 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2019-10-14 23:42:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:03,615 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-10-14 23:42:03,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-10-14 23:42:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:42:03,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:03,616 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:03,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 555004895, now seen corresponding path program 1 times [2019-10-14 23:42:03,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:03,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446544672] [2019-10-14 23:42:03,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:42:03,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446544672] [2019-10-14 23:42:03,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:03,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:03,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512830998] [2019-10-14 23:42:03,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:03,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:03,695 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 4 states. [2019-10-14 23:42:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:03,783 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2019-10-14 23:42:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:03,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 23:42:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:03,785 INFO L225 Difference]: With dead ends: 146 [2019-10-14 23:42:03,785 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:42:03,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:42:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-14 23:42:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 23:42:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-10-14 23:42:03,795 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2019-10-14 23:42:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:03,796 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-14 23:42:03,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2019-10-14 23:42:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:42:03,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:03,797 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:03,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash -624681896, now seen corresponding path program 1 times [2019-10-14 23:42:03,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:03,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84275240] [2019-10-14 23:42:03,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:03,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:42:03,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84275240] [2019-10-14 23:42:03,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:03,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:03,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829749868] [2019-10-14 23:42:03,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:03,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:03,854 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2019-10-14 23:42:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:04,086 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2019-10-14 23:42:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:04,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-14 23:42:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:04,089 INFO L225 Difference]: With dead ends: 192 [2019-10-14 23:42:04,089 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 23:42:04,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 23:42:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-10-14 23:42:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 23:42:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-10-14 23:42:04,122 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2019-10-14 23:42:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:04,124 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-10-14 23:42:04,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-10-14 23:42:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:42:04,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:04,126 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:04,127 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598883, now seen corresponding path program 1 times [2019-10-14 23:42:04,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:04,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110453805] [2019-10-14 23:42:04,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:42:04,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110453805] [2019-10-14 23:42:04,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:04,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:04,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976482865] [2019-10-14 23:42:04,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:04,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:04,232 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 4 states. [2019-10-14 23:42:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:04,397 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2019-10-14 23:42:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:04,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-14 23:42:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:04,400 INFO L225 Difference]: With dead ends: 183 [2019-10-14 23:42:04,401 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 23:42:04,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 23:42:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-14 23:42:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 23:42:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-10-14 23:42:04,428 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2019-10-14 23:42:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:04,429 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-10-14 23:42:04,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-10-14 23:42:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:42:04,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:04,434 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:04,434 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -576284788, now seen corresponding path program 1 times [2019-10-14 23:42:04,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:04,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796295189] [2019-10-14 23:42:04,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:04,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796295189] [2019-10-14 23:42:04,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:04,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:04,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880315140] [2019-10-14 23:42:04,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:04,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:04,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:04,514 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 4 states. [2019-10-14 23:42:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:04,617 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2019-10-14 23:42:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:04,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-14 23:42:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:04,619 INFO L225 Difference]: With dead ends: 134 [2019-10-14 23:42:04,619 INFO L226 Difference]: Without dead ends: 70 [2019-10-14 23:42:04,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-14 23:42:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-14 23:42:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:42:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-14 23:42:04,627 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2019-10-14 23:42:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:04,628 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-14 23:42:04,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-14 23:42:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:42:04,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:04,629 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:04,630 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -31288535, now seen corresponding path program 1 times [2019-10-14 23:42:04,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:04,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765752817] [2019-10-14 23:42:04,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:04,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765752817] [2019-10-14 23:42:04,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:04,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:04,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155498892] [2019-10-14 23:42:04,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:04,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:04,724 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 4 states. [2019-10-14 23:42:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:04,897 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2019-10-14 23:42:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:04,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:42:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:04,899 INFO L225 Difference]: With dead ends: 158 [2019-10-14 23:42:04,899 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 23:42:04,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 23:42:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-10-14 23:42:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 23:42:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2019-10-14 23:42:04,909 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2019-10-14 23:42:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:04,909 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2019-10-14 23:42:04,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2019-10-14 23:42:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:42:04,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:04,911 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:04,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash 180888733, now seen corresponding path program 1 times [2019-10-14 23:42:04,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:04,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988039177] [2019-10-14 23:42:04,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:04,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:04,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988039177] [2019-10-14 23:42:04,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:04,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:04,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126471949] [2019-10-14 23:42:04,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:04,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:04,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:04,952 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 4 states. [2019-10-14 23:42:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:05,089 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2019-10-14 23:42:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:05,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-14 23:42:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:05,091 INFO L225 Difference]: With dead ends: 166 [2019-10-14 23:42:05,091 INFO L226 Difference]: Without dead ends: 92 [2019-10-14 23:42:05,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-14 23:42:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-14 23:42:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-14 23:42:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2019-10-14 23:42:05,099 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2019-10-14 23:42:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:05,099 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2019-10-14 23:42:05,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2019-10-14 23:42:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:42:05,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:05,101 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:05,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 317242888, now seen corresponding path program 1 times [2019-10-14 23:42:05,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:05,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229347813] [2019-10-14 23:42:05,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:05,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229347813] [2019-10-14 23:42:05,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:05,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:05,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750597641] [2019-10-14 23:42:05,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:05,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:05,154 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 4 states. [2019-10-14 23:42:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:05,280 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2019-10-14 23:42:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:05,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-14 23:42:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:05,282 INFO L225 Difference]: With dead ends: 139 [2019-10-14 23:42:05,282 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:42:05,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:42:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-14 23:42:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 23:42:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2019-10-14 23:42:05,288 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2019-10-14 23:42:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:05,288 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-10-14 23:42:05,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2019-10-14 23:42:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:42:05,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:05,290 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:05,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196396, now seen corresponding path program 1 times [2019-10-14 23:42:05,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:05,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919329129] [2019-10-14 23:42:05,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:05,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919329129] [2019-10-14 23:42:05,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:05,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:05,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161710121] [2019-10-14 23:42:05,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:05,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:05,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:05,334 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 4 states. [2019-10-14 23:42:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:05,440 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-10-14 23:42:05,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:05,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-14 23:42:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:05,441 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:42:05,442 INFO L226 Difference]: Without dead ends: 70 [2019-10-14 23:42:05,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-14 23:42:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-14 23:42:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:42:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-10-14 23:42:05,447 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2019-10-14 23:42:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:05,448 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-10-14 23:42:05,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-10-14 23:42:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:42:05,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:05,449 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:05,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1000030502, now seen corresponding path program 1 times [2019-10-14 23:42:05,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:05,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914559021] [2019-10-14 23:42:05,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:05,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:42:05,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914559021] [2019-10-14 23:42:05,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:05,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:05,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415354513] [2019-10-14 23:42:05,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:05,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:05,516 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2019-10-14 23:42:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:05,608 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2019-10-14 23:42:05,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:05,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-14 23:42:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:05,609 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:42:05,609 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:42:05,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:42:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:42:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:42:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:42:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:42:05,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-14 23:42:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:05,612 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:42:05,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:42:05,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:42:05,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:42:05,791 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:42:05,792 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|)) [2019-10-14 23:42:05,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:42:05,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:42:05,792 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:42:05,792 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-10-14 23:42:05,793 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-10-14 23:42:05,794 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-10-14 23:42:05,795 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (= main_~this_state~0 3) (<= 4 main_~q~0)) (and (<= main_~this_state~0 0) (= main_~q~0 0))) [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-10-14 23:42:05,796 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L439 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-10-14 23:42:05,797 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-10-14 23:42:05,798 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-10-14 23:42:05,799 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-10-14 23:42:05,800 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L439 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= main_~this_state~0 3) (<= 4 main_~q~0)) (and .cse0 (= 2 main_~q~0)) (and .cse0 (= main_~q~0 0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)))) [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-10-14 23:42:05,801 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-10-14 23:42:05,802 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-10-14 23:42:05,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:42:05 BoogieIcfgContainer [2019-10-14 23:42:05,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:42:05,817 INFO L168 Benchmark]: Toolchain (without parser) took 4137.07 ms. Allocated memory was 139.5 MB in the beginning and 244.3 MB in the end (delta: 104.9 MB). Free memory was 103.1 MB in the beginning and 162.4 MB in the end (delta: -59.4 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,818 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.29 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 182.2 MB in the end (delta: -79.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,820 INFO L168 Benchmark]: Boogie Preprocessor took 51.59 ms. Allocated memory is still 203.9 MB. Free memory was 182.2 MB in the beginning and 179.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,821 INFO L168 Benchmark]: RCFGBuilder took 529.53 ms. Allocated memory is still 203.9 MB. Free memory was 179.7 MB in the beginning and 152.3 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,822 INFO L168 Benchmark]: TraceAbstraction took 3103.91 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 151.7 MB in the beginning and 162.4 MB in the end (delta: -10.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:42:05,826 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.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 447.29 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 182.2 MB in the end (delta: -79.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.59 ms. Allocated memory is still 203.9 MB. Free memory was 182.2 MB in the beginning and 179.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.53 ms. Allocated memory is still 203.9 MB. Free memory was 179.7 MB in the beginning and 152.3 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3103.91 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 151.7 MB in the beginning and 162.4 MB in the end (delta: -10.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((this_state == 3 && 4 <= q) || (this_state <= 0 && 2 == q)) || (this_state <= 0 && q == 0)) || (3 == q && 2 == this_state) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state == 3 && 4 <= q) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. Result: SAFE, OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1008 SDtfs, 1441 SDslu, 73 SDs, 0 SdLazy, 634 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 67 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 15354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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 correct! Received shutdown request...