java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:22:19,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:22:19,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:22:19,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:22:19,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:22:19,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:22:19,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:22:19,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:22:19,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:22:19,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:22:19,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:22:19,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:22:19,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:22:19,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:22:19,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:22:19,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:22:19,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:22:19,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:22:19,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:22:19,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:22:19,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:22:19,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:22:19,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:22:19,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:22:19,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:22:19,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:22:19,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:22:19,779 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:22:19,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:22:19,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:22:19,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:22:19,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:22:19,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:22:19,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:22:19,793 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:22:19,793 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:22:19,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:22:19,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:22:19,794 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:22:19,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:22:19,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:22:19,795 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:22:19,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:22:19,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:22:19,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:22:19,796 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:22:19,796 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:22:19,796 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:22:19,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:22:19,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:22:19,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:22:19,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:22:19,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:22:19,797 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:22:19,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:22:19,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:22:19,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:22:19,798 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:22:19,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:22:19,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:22:19,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:22:19,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:22:19,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:22:19,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:22:19,800 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:22:19,800 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:22:19,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:22:19,846 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:22:19,849 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:22:19,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:22:19,850 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:22:19,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-24 12:22:20,025 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:22:20,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:22:20,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:22:20,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:22:20,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:22:20,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20, skipping insertion in model container [2018-01-24 12:22:20,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,062 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:22:20,113 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:22:20,216 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:22:20,233 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:22:20,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20 WrapperNode [2018-01-24 12:22:20,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:22:20,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:22:20,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:22:20,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:22:20,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... [2018-01-24 12:22:20,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:22:20,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:22:20,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:22:20,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:22:20,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:22:20,322 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 12:22:20,323 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:22:20,324 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:22:20,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:22:20,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:22:20,551 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:22:20,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:22:20 BoogieIcfgContainer [2018-01-24 12:22:20,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:22:20,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:22:20,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:22:20,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:22:20,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:22:20" (1/3) ... [2018-01-24 12:22:20,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe1987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:22:20, skipping insertion in model container [2018-01-24 12:22:20,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:22:20" (2/3) ... [2018-01-24 12:22:20,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe1987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:22:20, skipping insertion in model container [2018-01-24 12:22:20,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:22:20" (3/3) ... [2018-01-24 12:22:20,558 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-24 12:22:20,565 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:22:20,571 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 12:22:20,615 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:22:20,615 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:22:20,615 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:22:20,615 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:22:20,615 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:22:20,616 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:22:20,616 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:22:20,616 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:22:20,617 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:22:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-24 12:22:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:22:20,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:20,643 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:20,644 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-01-24 12:22:20,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:20,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:20,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:20,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:20,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:20,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:20,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:20,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:22:20,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:22:20,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:22:20,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:22:20,855 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-24 12:22:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:21,081 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2018-01-24 12:22:21,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:22:21,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:22:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:21,096 INFO L225 Difference]: With dead ends: 148 [2018-01-24 12:22:21,096 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:22:21,100 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:22:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:22:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-01-24 12:22:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 12:22:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-24 12:22:21,148 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-01-24 12:22:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:21,148 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-24 12:22:21,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:22:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-24 12:22:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:22:21,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:21,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:21,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-01-24 12:22:21,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:21,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:21,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:21,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:21,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:21,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:21,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:22:21,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:22:21,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:22:21,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:22:21,277 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-01-24 12:22:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:21,315 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-01-24 12:22:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:22:21,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:22:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:21,317 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:22:21,317 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:22:21,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:22:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:22:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-01-24 12:22:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:22:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-24 12:22:21,324 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-01-24 12:22:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:21,325 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-24 12:22:21,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:22:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-24 12:22:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:22:21,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:21,325 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:21,326 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-01-24 12:22:21,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:21,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:21,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:21,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:21,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:21,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:21,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:22:21,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:22:21,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:22:21,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:22:21,414 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-01-24 12:22:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:21,485 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-24 12:22:21,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:22:21,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:22:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:21,487 INFO L225 Difference]: With dead ends: 65 [2018-01-24 12:22:21,487 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:22:21,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:22:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:22:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 12:22:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:22:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-24 12:22:21,495 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-01-24 12:22:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:21,496 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-24 12:22:21,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:22:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-24 12:22:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:22:21,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:21,498 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:21,498 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-01-24 12:22:21,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:21,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:21,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:21,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:21,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:21,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:21,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:22:21,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:22:21,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:22:21,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:22:21,568 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-24 12:22:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:21,673 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-24 12:22:21,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:22:21,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:22:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:21,675 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:22:21,675 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:22:21,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:22:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:22:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:22:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:22:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 12:22:21,682 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-01-24 12:22:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:21,682 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 12:22:21,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:22:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 12:22:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:22:21,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:21,684 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:21,684 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-01-24 12:22:21,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:21,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:21,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:21,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:21,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:21,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:21,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:22:21,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:22:21,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:22:21,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:22:21,999 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-01-24 12:22:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:22,195 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-24 12:22:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:22:22,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:22:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:22,197 INFO L225 Difference]: With dead ends: 110 [2018-01-24 12:22:22,197 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 12:22:22,198 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:22:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 12:22:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-24 12:22:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 12:22:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-24 12:22:22,209 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-01-24 12:22:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:22,210 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-24 12:22:22,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:22:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-24 12:22:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:22:22,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:22,211 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:22,211 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-01-24 12:22:22,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:22,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:22,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:22,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:22,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:22,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:22,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:22,524 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:22,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:22,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:22,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:22:22,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:22,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 12:22:22,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:22,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:22:22,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:22:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:22,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:22,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 12:22:22,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:22:22,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:22:22,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:22:22,989 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-01-24 12:22:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:23,290 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-24 12:22:23,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:22:23,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 12:22:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:23,292 INFO L225 Difference]: With dead ends: 114 [2018-01-24 12:22:23,292 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:22:23,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:22:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:22:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-24 12:22:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:22:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 12:22:23,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-01-24 12:22:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:23,300 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 12:22:23,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:22:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 12:22:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:22:23,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:23,301 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:23,301 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-01-24 12:22:23,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:23,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:23,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:23,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:23,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:23,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:23,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:23,589 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:23,594 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:22:23,608 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:23,612 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:23,613 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:22:23,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:23,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:22:23,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:23,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 12:22:23,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:23,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:22:23,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:22:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:23,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:23,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-01-24 12:22:23,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:22:23,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:22:23,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:22:23,969 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 22 states. [2018-01-24 12:22:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:24,436 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-01-24 12:22:24,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:22:24,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-01-24 12:22:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:24,437 INFO L225 Difference]: With dead ends: 119 [2018-01-24 12:22:24,437 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:22:24,438 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:22:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:22:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 12:22:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 12:22:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-24 12:22:24,445 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 27 [2018-01-24 12:22:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:24,445 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-24 12:22:24,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:22:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-24 12:22:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:22:24,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:24,447 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:24,447 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1394614594, now seen corresponding path program 1 times [2018-01-24 12:22:24,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:24,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:24,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,448 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:22:24,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:24,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 12:22:24,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:24,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:22:24,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:22:24,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:22:24,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:22:24,514 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2018-01-24 12:22:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:24,582 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-24 12:22:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:22:24,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-24 12:22:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:24,585 INFO L225 Difference]: With dead ends: 99 [2018-01-24 12:22:24,585 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 12:22:24,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:22:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 12:22:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2018-01-24 12:22:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 12:22:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2018-01-24 12:22:24,596 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 43 [2018-01-24 12:22:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:24,597 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2018-01-24 12:22:24,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:22:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-01-24 12:22:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:22:24,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:24,599 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:24,599 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1394614593, now seen corresponding path program 1 times [2018-01-24 12:22:24,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:24,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:24,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:24,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:24,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-24 12:22:24,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:24,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:22:24,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:22:24,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:22:24,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:22:24,700 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 6 states. [2018-01-24 12:22:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:24,804 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-01-24 12:22:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:22:24,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-24 12:22:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:24,806 INFO L225 Difference]: With dead ends: 89 [2018-01-24 12:22:24,806 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:22:24,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:22:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:22:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-24 12:22:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:22:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-01-24 12:22:24,816 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 43 [2018-01-24 12:22:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:24,816 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-01-24 12:22:24,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:22:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-01-24 12:22:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:22:24,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:24,818 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-01-24 12:22:24,818 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1822450248, now seen corresponding path program 1 times [2018-01-24 12:22:24,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:24,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:24,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:24,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:24,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-24 12:22:24,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:24,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:22:24,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:22:24,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:22:24,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:22:24,941 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 5 states. [2018-01-24 12:22:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:25,009 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2018-01-24 12:22:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:22:25,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-24 12:22:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:25,011 INFO L225 Difference]: With dead ends: 150 [2018-01-24 12:22:25,011 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:22:25,011 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:22:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:22:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-01-24 12:22:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:22:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-24 12:22:25,019 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 46 [2018-01-24 12:22:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:25,020 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-24 12:22:25,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:22:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-24 12:22:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:22:25,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:25,021 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:25,021 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1744755328, now seen corresponding path program 1 times [2018-01-24 12:22:25,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:25,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:25,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:25,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:25,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:25,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:25,143 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:25,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:25,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:25,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:25,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-24 12:22:25,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:22:25,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:22:25,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:22:25,296 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 13 states. [2018-01-24 12:22:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:25,347 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-01-24 12:22:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:22:25,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-01-24 12:22:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:25,352 INFO L225 Difference]: With dead ends: 154 [2018-01-24 12:22:25,352 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:22:25,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:22:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:22:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-01-24 12:22:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:22:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-01-24 12:22:25,362 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 46 [2018-01-24 12:22:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:25,362 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-01-24 12:22:25,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:22:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-01-24 12:22:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:22:25,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:25,364 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:25,364 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash 927663305, now seen corresponding path program 2 times [2018-01-24 12:22:25,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:25,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:25,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:25,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:25,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:25,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:25,470 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:25,475 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:22:25,486 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:25,487 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:22:25,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 12:22:25,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:22:25,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-01-24 12:22:25,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:22:25,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:22:25,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:22:25,563 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 11 states. [2018-01-24 12:22:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:25,782 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2018-01-24 12:22:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:22:25,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-01-24 12:22:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:25,784 INFO L225 Difference]: With dead ends: 183 [2018-01-24 12:22:25,784 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 12:22:25,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:22:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 12:22:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2018-01-24 12:22:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 12:22:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-24 12:22:25,795 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 50 [2018-01-24 12:22:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:25,795 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-24 12:22:25,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:22:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-24 12:22:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:22:25,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:25,796 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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] [2018-01-24 12:22:25,796 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2044492860, now seen corresponding path program 1 times [2018-01-24 12:22:25,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:25,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:25,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,798 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:22:25,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:25,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:22:25,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:25,956 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:25,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:25,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:26,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:26,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-24 12:22:26,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:22:26,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:22:26,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:22:26,101 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 17 states. [2018-01-24 12:22:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:26,192 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-01-24 12:22:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:22:26,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-01-24 12:22:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:26,194 INFO L225 Difference]: With dead ends: 160 [2018-01-24 12:22:26,194 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:22:26,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:22:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:22:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-24 12:22:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 12:22:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-24 12:22:26,202 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 56 [2018-01-24 12:22:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:26,203 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-24 12:22:26,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:22:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-24 12:22:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:22:26,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:26,204 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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] [2018-01-24 12:22:26,204 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1800200379, now seen corresponding path program 2 times [2018-01-24 12:22:26,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:26,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:26,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:26,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:26,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:22:26,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:26,344 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:26,355 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:22:26,367 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:26,381 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:26,383 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:22:26,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:26,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:26,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 12:22:26,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:22:26,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:22:26,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:22:26,490 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 19 states. [2018-01-24 12:22:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:26,549 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2018-01-24 12:22:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:22:26,550 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 12:22:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:26,550 INFO L225 Difference]: With dead ends: 164 [2018-01-24 12:22:26,550 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 12:22:26,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:22:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 12:22:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-24 12:22:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:22:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-24 12:22:26,561 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 60 [2018-01-24 12:22:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:26,561 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-24 12:22:26,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:22:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-24 12:22:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:22:26,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:26,562 INFO L322 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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] [2018-01-24 12:22:26,563 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:22:26,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1308562894, now seen corresponding path program 3 times [2018-01-24 12:22:26,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:26,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:26,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,564 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:22:26,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:26,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:22:26,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:26,717 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:26,728 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:22:26,741 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:22:26,746 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:22:26,748 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:22:26,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:26,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 12:22:26,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:22:26,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 12:22:26,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 12:22:26,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:22:26,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:22:27,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-24 12:22:27,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-24 12:22:27,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 12:22:27,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:27,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 12:22:27,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:22:27,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 12:22:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 12:22:27,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:27,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-01-24 12:22:27,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:22:27,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:22:27,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2018-01-24 12:22:27,392 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 23 states. [2018-01-24 12:22:50,400 WARN L143 SmtUtils]: Spent 14142ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-24 12:23:12,594 WARN L146 SmtUtils]: Spent 22138ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-01-24 12:23:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:12,983 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2018-01-24 12:23:12,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:23:12,983 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-01-24 12:23:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:12,985 INFO L225 Difference]: With dead ends: 229 [2018-01-24 12:23:12,985 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 12:23:12,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=294, Invalid=1509, Unknown=3, NotChecked=0, Total=1806 [2018-01-24 12:23:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 12:23:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 122. [2018-01-24 12:23:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 12:23:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-01-24 12:23:13,002 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 64 [2018-01-24 12:23:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:13,002 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-01-24 12:23:13,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:23:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-01-24 12:23:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:23:13,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:13,004 INFO L322 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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] [2018-01-24 12:23:13,004 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash -68509738, now seen corresponding path program 1 times [2018-01-24 12:23:13,004 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:13,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:13,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:13,006 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:23:13,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:13,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:23:13,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:13,180 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:23:13,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:13,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:13,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:13,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-01-24 12:23:13,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:23:13,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:23:13,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:23:13,326 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 23 states. [2018-01-24 12:23:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:13,404 INFO L93 Difference]: Finished difference Result 202 states and 241 transitions. [2018-01-24 12:23:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:23:13,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-01-24 12:23:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:13,406 INFO L225 Difference]: With dead ends: 202 [2018-01-24 12:23:13,406 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 12:23:13,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:23:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 12:23:13,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-01-24 12:23:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 12:23:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2018-01-24 12:23:13,427 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 68 [2018-01-24 12:23:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:13,428 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2018-01-24 12:23:13,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:23:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2018-01-24 12:23:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 12:23:13,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:13,429 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:23:13,429 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451295, now seen corresponding path program 2 times [2018-01-24 12:23:13,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:13,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:13,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:13,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:13,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:13,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:23:13,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:13,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:23:13,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:23:13,720 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:23:13,737 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:23:13,742 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:23:13,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:13,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:23:13,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:13,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:23:13,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:23:13,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:13,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:13,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:23:13,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:13,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:23:13,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:23:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:23:13,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:13,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-24 12:23:13,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:23:13,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:23:13,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:23:13,840 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 13 states. [2018-01-24 12:23:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:14,263 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2018-01-24 12:23:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:23:14,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-01-24 12:23:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:14,265 INFO L225 Difference]: With dead ends: 162 [2018-01-24 12:23:14,265 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 12:23:14,265 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:23:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 12:23:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2018-01-24 12:23:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 12:23:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-01-24 12:23:14,286 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 72 [2018-01-24 12:23:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:14,287 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-01-24 12:23:14,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:23:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-01-24 12:23:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:23:14,288 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:14,288 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:23:14,288 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-01-24 12:23:14,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:14,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:14,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:14,290 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:23:14,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:14,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-24 12:23:14,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:14,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:23:14,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:23:14,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:23:14,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:23:14,340 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-01-24 12:23:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:14,396 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-01-24 12:23:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:14,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-01-24 12:23:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:14,398 INFO L225 Difference]: With dead ends: 142 [2018-01-24 12:23:14,398 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 12:23:14,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 12:23:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-01-24 12:23:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 12:23:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-24 12:23:14,422 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-01-24 12:23:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:14,422 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-24 12:23:14,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:23:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-24 12:23:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-24 12:23:14,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:14,424 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:23:14,424 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-01-24 12:23:14,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:14,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:14,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:14,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:14,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:14,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-01-24 12:23:14,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:14,658 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:23:14,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:14,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-01-24 12:23:14,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:14,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-24 12:23:14,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:23:14,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:23:14,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-24 12:23:14,917 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 13 states. [2018-01-24 12:23:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:15,264 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-24 12:23:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:23:15,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-01-24 12:23:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:15,265 INFO L225 Difference]: With dead ends: 126 [2018-01-24 12:23:15,265 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:23:15,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-01-24 12:23:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:23:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 12:23:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 12:23:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-24 12:23:15,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-01-24 12:23:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:15,281 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-24 12:23:15,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:23:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-24 12:23:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-24 12:23:15,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:15,282 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:23:15,282 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-01-24 12:23:15,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:15,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:15,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:15,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:15,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:15,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-01-24 12:23:15,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:15,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:23:15,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:23:15,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:23:15,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:23:15,339 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-01-24 12:23:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:15,507 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-01-24 12:23:15,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:23:15,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-24 12:23:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:15,509 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:23:15,509 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 12:23:15,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:23:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 12:23:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-01-24 12:23:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 12:23:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-01-24 12:23:15,523 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-01-24 12:23:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:15,523 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-01-24 12:23:15,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:23:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-01-24 12:23:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 12:23:15,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:15,524 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:23:15,524 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-01-24 12:23:15,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:15,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:15,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:15,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:15,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:15,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-01-24 12:23:15,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:15,627 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:23:15,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:15,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-01-24 12:23:15,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:15,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-24 12:23:15,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:23:15,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:23:15,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:23:15,862 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 8 states. [2018-01-24 12:23:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:15,977 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-01-24 12:23:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:23:15,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-01-24 12:23:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:15,978 INFO L225 Difference]: With dead ends: 150 [2018-01-24 12:23:15,978 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 12:23:15,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:23:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 12:23:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-01-24 12:23:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 12:23:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-24 12:23:15,995 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-01-24 12:23:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:15,996 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-24 12:23:15,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:23:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-24 12:23:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 12:23:15,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:15,997 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:15,997 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-01-24 12:23:15,997 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:15,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:15,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:15,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:15,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:16,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-01-24 12:23:16,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:16,768 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:23:16,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:16,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:16,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:23:16,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:16,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 12:23:16,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:16,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-24 12:23:16,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:16,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 12:23:16,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:16,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:23:16,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-24 12:23:18,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-24 12:23:18,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-01-24 12:23:18,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-24 12:23:18,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-01-24 12:23:18,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-24 12:23:18,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-24 12:23:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-01-24 12:23:18,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-24 12:23:18,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:23:18,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-24 12:23:18,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:18,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:18,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-01-24 12:23:18,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:19,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 100 [2018-01-24 12:23:19,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 12:23:19,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-01-24 12:23:19,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:19,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-01-24 12:23:19,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:19,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-01-24 12:23:19,546 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:19,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-01-24 12:23:19,725 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 12:23:19,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:19,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-24 12:23:19,938 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-24 12:23:20,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-24 12:23:20,234 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-24 12:23:20,600 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 240 DAG size of output 61 [2018-01-24 12:23:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 76 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:23:20,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:20,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 40 [2018-01-24 12:23:20,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-24 12:23:20,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-24 12:23:20,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1497, Unknown=4, NotChecked=0, Total=1640 [2018-01-24 12:23:20,691 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 41 states. Received shutdown request... [2018-01-24 12:23:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:22,993 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:23:22,997 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:23:22,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:23:22 BoogieIcfgContainer [2018-01-24 12:23:22,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:23:22,998 INFO L168 Benchmark]: Toolchain (without parser) took 62971.91 ms. Allocated memory was 301.5 MB in the beginning and 610.3 MB in the end (delta: 308.8 MB). Free memory was 260.4 MB in the beginning and 524.4 MB in the end (delta: -264.0 MB). Peak memory consumption was 44.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:23:22,999 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:23:22,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.36 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 247.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:23:22,999 INFO L168 Benchmark]: Boogie Preprocessor took 35.58 ms. Allocated memory is still 301.5 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:23:23,000 INFO L168 Benchmark]: RCFGBuilder took 273.55 ms. Allocated memory is still 301.5 MB. Free memory was 245.3 MB in the beginning and 225.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:23:23,000 INFO L168 Benchmark]: TraceAbstraction took 62444.68 ms. Allocated memory was 301.5 MB in the beginning and 610.3 MB in the end (delta: 308.8 MB). Free memory was 224.4 MB in the beginning and 524.4 MB in the end (delta: -300.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:23:23,001 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.36 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 247.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.58 ms. Allocated memory is still 301.5 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 273.55 ms. Allocated memory is still 301.5 MB. Free memory was 245.3 MB in the beginning and 225.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62444.68 ms. Allocated memory was 301.5 MB in the beginning and 610.3 MB in the end (delta: 308.8 MB). Free memory was 224.4 MB in the beginning and 524.4 MB in the end (delta: -300.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 5 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 58. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 62.3s OverallTime, 22 OverallIterations, 11 TraceHistogramMax, 51.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1190 SDtfs, 976 SDslu, 6394 SDs, 0 SdLazy, 2878 SolverSat, 194 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 654 SyntacticMatches, 11 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 218 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1806 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1772 ConstructedInterpolants, 93 QuantifiedInterpolants, 947726 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2219 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 2293/3352 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-23-23-007.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-23-23-007.csv Completed graceful shutdown