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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:16:22,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:16:22,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:16:22,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:16:22,459 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:16:22,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:16:22,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:16:22,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:16:22,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:16:22,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:16:22,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:16:22,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:16:22,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:16:22,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:16:22,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:16:22,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:16:22,470 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:16:22,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:16:22,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:16:22,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:16:22,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:16:22,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:16:22,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:16:22,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:16:22,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:16:22,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:16:22,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:16:22,478 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:16:22,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:16:22,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:16:22,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:16:22,479 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:16:22,488 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:16:22,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:16:22,489 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:16:22,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:16:22,490 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:16:22,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:16:22,490 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:16:22,490 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:16:22,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:16:22,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:16:22,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:16:22,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:16:22,492 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:16:22,492 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:16:22,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:16:22,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:16:22,493 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:16:22,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:16:22,493 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:16:22,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:16:22,533 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:16:22,537 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:16:22,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:16:22,541 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:16:22,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-02-02 19:16:22,677 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:16:22,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:16:22,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:16:22,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:16:22,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:16:22,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0fff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22, skipping insertion in model container [2018-02-02 19:16:22,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,706 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:16:22,744 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:16:22,827 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:16:22,845 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:16:22,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22 WrapperNode [2018-02-02 19:16:22,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:16:22,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:16:22,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:16:22,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:16:22,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... [2018-02-02 19:16:22,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:16:22,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:16:22,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:16:22,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:16:22,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 19:16:22,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:16:22,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:16:22,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:16:22,908 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 19:16:22,908 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 19:16:22,909 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:16:22,909 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 19:16:22,909 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:16:22,910 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:16:22,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:16:22,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:16:23,081 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:16:23,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:16:23 BoogieIcfgContainer [2018-02-02 19:16:23,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:16:23,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:16:23,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:16:23,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:16:23,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:16:22" (1/3) ... [2018-02-02 19:16:23,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b18abad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:16:23, skipping insertion in model container [2018-02-02 19:16:23,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:16:22" (2/3) ... [2018-02-02 19:16:23,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b18abad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:16:23, skipping insertion in model container [2018-02-02 19:16:23,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:16:23" (3/3) ... [2018-02-02 19:16:23,086 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 19:16:23,092 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:16:23,097 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 19:16:23,120 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:16:23,120 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:16:23,120 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:16:23,120 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:16:23,120 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:16:23,120 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:16:23,120 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:16:23,121 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:16:23,121 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:16:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 19:16:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:16:23,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:23,141 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:23,141 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 19:16:23,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:23,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:23,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,179 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:23,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:23,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:23,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:23,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:16:23,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:16:23,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:16:23,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:16:23,296 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 19:16:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:23,496 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 19:16:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:16:23,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 19:16:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:23,506 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:16:23,507 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:16:23,508 INFO L554 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-02-02 19:16:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:16:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 19:16:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:16:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 19:16:23,546 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 19:16:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:23,546 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 19:16:23,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:16:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 19:16:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:16:23,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:23,547 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:23,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 19:16:23,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:23,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:23,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:23,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:23,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:23,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:23,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:16:23,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:16:23,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:16:23,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:16:23,617 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 19:16:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:23,641 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 19:16:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:16:23,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:16:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:23,643 INFO L225 Difference]: With dead ends: 94 [2018-02-02 19:16:23,643 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 19:16:23,644 INFO L554 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-02-02 19:16:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 19:16:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 19:16:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 19:16:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 19:16:23,652 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 19:16:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:23,653 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 19:16:23,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:16:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 19:16:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:16:23,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:23,654 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:23,654 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 19:16:23,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:23,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:23,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:23,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:23,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:23,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:23,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:16:23,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:16:23,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:16:23,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:16:23,709 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 19:16:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:23,737 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 19:16:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:16:23,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:16:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:23,738 INFO L225 Difference]: With dead ends: 72 [2018-02-02 19:16:23,738 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 19:16:23,739 INFO L554 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-02-02 19:16:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 19:16:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 19:16:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 19:16:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 19:16:23,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 19:16:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:23,744 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 19:16:23,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:16:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 19:16:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:16:23,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:23,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:23,745 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 19:16:23,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:23,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:23,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:23,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:23,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:23,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:23,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:16:23,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:16:23,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:16:23,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:16:23,805 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 19:16:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:23,872 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 19:16:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:16:23,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:16:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:23,873 INFO L225 Difference]: With dead ends: 71 [2018-02-02 19:16:23,873 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 19:16:23,874 INFO L554 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-02-02 19:16:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 19:16:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 19:16:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 19:16:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 19:16:23,878 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 19:16:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:23,879 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 19:16:23,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:16:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 19:16:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:16:23,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:23,879 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:23,880 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 19:16:23,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:23,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:23,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:23,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:23,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:24,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:24,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:16:24,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:16:24,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:16:24,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:16:24,078 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 19:16:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:24,237 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 19:16:24,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:16:24,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 19:16:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:24,238 INFO L225 Difference]: With dead ends: 75 [2018-02-02 19:16:24,238 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 19:16:24,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:16:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 19:16:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 19:16:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:16:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 19:16:24,244 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 19:16:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:24,244 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 19:16:24,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:16:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 19:16:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:16:24,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:24,245 INFO L351 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-02-02 19:16:24,245 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 19:16:24,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:24,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:24,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:24,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:24,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:24,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:24,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:24,466 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:24,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:24,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:24,546 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-02-02 19:16:24,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:24,559 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-02-02 19:16:24,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:24,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:24,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:16:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:24,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:24,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 19:16:24,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:16:24,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:16:24,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:16:24,841 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-02-02 19:16:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:25,095 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 19:16:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:16:25,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-02 19:16:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:25,097 INFO L225 Difference]: With dead ends: 79 [2018-02-02 19:16:25,097 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 19:16:25,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:16:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 19:16:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-02 19:16:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 19:16:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-02 19:16:25,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-02 19:16:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:25,101 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-02 19:16:25,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:16:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-02 19:16:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:16:25,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:25,102 INFO L351 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-02-02 19:16:25,102 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 19:16:25,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:25,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:25,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,103 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:25,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:25,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:25,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:25,285 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:25,290 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:16:25,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:16:25,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:25,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:25,328 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-02-02 19:16:25,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,337 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-02-02 19:16:25,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:25,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:16:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:25,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:25,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-02 19:16:25,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:16:25,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:16:25,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:16:25,520 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 22 states. [2018-02-02 19:16:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:25,887 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-02-02 19:16:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:16:25,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-02 19:16:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:25,888 INFO L225 Difference]: With dead ends: 84 [2018-02-02 19:16:25,888 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 19:16:25,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:16:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 19:16:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 19:16:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:16:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 19:16:25,891 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 27 [2018-02-02 19:16:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:25,892 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 19:16:25,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:16:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 19:16:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:16:25,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:25,893 INFO L351 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-02-02 19:16:25,893 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1407021697, now seen corresponding path program 1 times [2018-02-02 19:16:25,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:25,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:25,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,894 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:25,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:25,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 19:16:25,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:25,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:16:25,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:16:25,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:16:25,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:16:25,947 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2018-02-02 19:16:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:25,961 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-02 19:16:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:16:25,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-02-02 19:16:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:25,962 INFO L225 Difference]: With dead ends: 88 [2018-02-02 19:16:25,962 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 19:16:25,963 INFO L554 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-02-02 19:16:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 19:16:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-02 19:16:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 19:16:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-02 19:16:25,966 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 46 [2018-02-02 19:16:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:25,966 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-02 19:16:25,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:16:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-02 19:16:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:16:25,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:25,968 INFO L351 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, 1] [2018-02-02 19:16:25,968 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719882, now seen corresponding path program 1 times [2018-02-02 19:16:25,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:25,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:25,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:25,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:25,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 19:16:26,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:26,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:16:26,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:16:26,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:16:26,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:16:26,020 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 6 states. [2018-02-02 19:16:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:26,116 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-02-02 19:16:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:16:26,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 19:16:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:26,117 INFO L225 Difference]: With dead ends: 128 [2018-02-02 19:16:26,117 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 19:16:26,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:16:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 19:16:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-02-02 19:16:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 19:16:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 19:16:26,120 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 47 [2018-02-02 19:16:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:26,121 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 19:16:26,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:16:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 19:16:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:16:26,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:26,123 INFO L351 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, 1] [2018-02-02 19:16:26,123 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 1 times [2018-02-02 19:16:26,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:26,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:26,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:26,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:26,181 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:26,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:26,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:26,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 19:16:26,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:16:26,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:16:26,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:16:26,300 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 13 states. [2018-02-02 19:16:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:26,360 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 19:16:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:16:26,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-02 19:16:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:26,362 INFO L225 Difference]: With dead ends: 116 [2018-02-02 19:16:26,362 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:16:26,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:16:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:16:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 19:16:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 19:16:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 19:16:26,366 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-02 19:16:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:26,366 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 19:16:26,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:16:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 19:16:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:16:26,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:26,368 INFO L351 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, 1] [2018-02-02 19:16:26,368 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 2 times [2018-02-02 19:16:26,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:26,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:26,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:26,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:26,434 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:26,442 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:16:26,460 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:16:26,460 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:26,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 19:16:26,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:16:26,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-02 19:16:26,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:16:26,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:16:26,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:16:26,513 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 11 states. [2018-02-02 19:16:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:26,642 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-02-02 19:16:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:16:26,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-02 19:16:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:26,643 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:16:26,643 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 19:16:26,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:16:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 19:16:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2018-02-02 19:16:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 19:16:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-02 19:16:26,648 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 51 [2018-02-02 19:16:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:26,648 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-02 19:16:26,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:16:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-02 19:16:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:16:26,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:26,650 INFO L351 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-02-02 19:16:26,650 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 1 times [2018-02-02 19:16:26,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:26,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:26,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,651 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:26,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:16:26,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:26,755 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:26,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:26,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:26,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 19:16:26,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:16:26,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:16:26,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:16:26,886 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 17 states. [2018-02-02 19:16:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:26,932 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-02 19:16:26,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:16:26,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 19:16:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:26,933 INFO L225 Difference]: With dead ends: 123 [2018-02-02 19:16:26,933 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 19:16:26,933 INFO L554 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-02-02 19:16:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 19:16:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-02 19:16:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 19:16:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-02 19:16:26,936 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 56 [2018-02-02 19:16:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:26,936 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-02 19:16:26,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:16:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-02 19:16:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 19:16:26,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:26,937 INFO L351 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-02-02 19:16:26,937 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077308, now seen corresponding path program 2 times [2018-02-02 19:16:26,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:26,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:26,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,938 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:16:27,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:27,011 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:27,021 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:16:27,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:16:27,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:27,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:16:27,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:27,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 19:16:27,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:16:27,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:16:27,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:16:27,176 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 19 states. [2018-02-02 19:16:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:27,239 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-02-02 19:16:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:16:27,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 19:16:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:27,242 INFO L225 Difference]: With dead ends: 127 [2018-02-02 19:16:27,242 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 19:16:27,242 INFO L554 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-02-02 19:16:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 19:16:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-02-02 19:16:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 19:16:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-02 19:16:27,246 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 60 [2018-02-02 19:16:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:27,247 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-02 19:16:27,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:16:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-02 19:16:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 19:16:27,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:27,248 INFO L351 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-02-02 19:16:27,248 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:16:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113861, now seen corresponding path program 3 times [2018-02-02 19:16:27,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:27,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:27,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:27,249 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:27,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:27,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:16:27,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:27,352 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:16:27,360 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:16:27,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 19:16:27,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:27,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:27,432 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-02-02 19:16:27,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,447 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-02-02 19:16:27,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,448 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-02-02 19:16:27,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,462 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-02-02 19:16:27,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:27,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:16:27,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:27,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:27,655 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 35 treesize of output 29 [2018-02-02 19:16:27,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:27,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:27,693 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 37 treesize of output 31 [2018-02-02 19:16:27,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:27,711 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 31 treesize of output 40 [2018-02-02 19:16:27,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,731 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 29 treesize of output 28 [2018-02-02 19:16:27,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:27,744 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-02-02 19:16:27,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 19:16:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 19:16:27,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:27,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-02-02 19:16:27,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:16:27,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:16:27,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2018-02-02 19:16:27,819 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 23 states. [2018-02-02 19:16:50,335 WARN L143 SmtUtils]: Spent 14297ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-02 19:17:10,647 WARN L146 SmtUtils]: Spent 20266ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-02 19:17:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:17:10,943 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-02-02 19:17:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:17:10,944 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-02 19:17:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:17:10,945 INFO L225 Difference]: With dead ends: 200 [2018-02-02 19:17:10,945 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 19:17:10,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=294, Invalid=1509, Unknown=3, NotChecked=0, Total=1806 [2018-02-02 19:17:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 19:17:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2018-02-02 19:17:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 19:17:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-02 19:17:10,949 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-02 19:17:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:17:10,949 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-02 19:17:10,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:17:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-02 19:17:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 19:17:10,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:17:10,950 INFO L351 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-02-02 19:17:10,950 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:17:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 1 times [2018-02-02 19:17:10,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:17:10,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:17:10,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:10,952 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:17:10,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:10,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:17:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:17:11,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:17:11,069 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:17:11,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:11,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:17:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:17:11,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:17:11,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-02 19:17:11,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:17:11,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:17:11,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:17:11,204 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 23 states. [2018-02-02 19:17:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:17:11,262 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-02 19:17:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:17:11,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-02 19:17:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:17:11,263 INFO L225 Difference]: With dead ends: 150 [2018-02-02 19:17:11,263 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:17:11,263 INFO L554 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-02-02 19:17:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:17:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-02 19:17:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 19:17:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-02 19:17:11,266 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 68 [2018-02-02 19:17:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:17:11,266 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-02 19:17:11,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:17:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-02 19:17:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 19:17:11,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:17:11,267 INFO L351 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-02-02 19:17:11,267 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:17:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 2 times [2018-02-02 19:17:11,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:17:11,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:17:11,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,268 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:11,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:11,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:17:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 19:17:11,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:17:11,395 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:17:11,407 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:17:11,428 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:17:11,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:17:11,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:17:11,433 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-02-02 19:17:11,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:11,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:11,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:17:11,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:11,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:11,469 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-02-02 19:17:11,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:11,473 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-02-02 19:17:11,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 19:17:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 19:17:11,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:17:11,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-02-02 19:17:11,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:17:11,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:17:11,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:17:11,509 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 13 states. [2018-02-02 19:17:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:17:11,807 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-02 19:17:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:17:11,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-02-02 19:17:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:17:11,808 INFO L225 Difference]: With dead ends: 193 [2018-02-02 19:17:11,809 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 19:17:11,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:17:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 19:17:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-02 19:17:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:17:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 19:17:11,813 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-02-02 19:17:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:17:11,813 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 19:17:11,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:17:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 19:17:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:17:11,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:17:11,814 INFO L351 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-02-02 19:17:11,814 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:17:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-02 19:17:11,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:17:11,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:17:11,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,815 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:17:11,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:11,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:17:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 19:17:11,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:17:11,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:17:11,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:17:11,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:17:11,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:17:11,855 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-02 19:17:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:17:11,878 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-02 19:17:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:17:11,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 19:17:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:17:11,880 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:17:11,880 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 19:17:11,880 INFO L554 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-02-02 19:17:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 19:17:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-02 19:17:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:17:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 19:17:11,884 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-02 19:17:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:17:11,884 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 19:17:11,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:17:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 19:17:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:17:11,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:17:11,885 INFO L351 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, 1] [2018-02-02 19:17:11,885 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:17:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-02 19:17:11,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:17:11,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:17:11,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:11,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:11,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:17:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 19:17:12,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:17:12,050 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:17:12,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:12,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:17:12,094 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-02-02 19:17:12,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:12,103 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 14 treesize of output 13 [2018-02-02 19:17:12,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:12,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 19:17:12,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-02 19:17:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:17:15,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:17:15,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-02 19:17:15,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:17:15,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:17:15,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=817, Unknown=1, NotChecked=0, Total=930 [2018-02-02 19:17:15,180 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 31 states. [2018-02-02 19:17:38,588 WARN L146 SmtUtils]: Spent 1892ms on a formula simplification. DAG size of input: 41 DAG size of output 31 [2018-02-02 19:17:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:17:45,090 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2018-02-02 19:17:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:17:45,090 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-02 19:17:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:17:45,091 INFO L225 Difference]: With dead ends: 157 [2018-02-02 19:17:45,091 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 19:17:45,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=544, Invalid=2994, Unknown=2, NotChecked=0, Total=3540 [2018-02-02 19:17:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 19:17:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2018-02-02 19:17:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 19:17:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-02 19:17:45,094 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-02 19:17:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:17:45,095 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-02 19:17:45,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:17:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-02 19:17:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 19:17:45,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:17:45,096 INFO L351 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, 1, 1] [2018-02-02 19:17:45,096 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:17:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-02 19:17:45,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:17:45,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:17:45,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:45,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:45,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:17:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:45,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:17:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:17:45,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:17:45,964 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:17:45,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:17:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:17:45,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:17:46,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 19:17:46,031 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 12 treesize of output 11 [2018-02-02 19:17:46,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-02 19:17:46,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-02 19:17:46,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,074 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 18 treesize of output 27 [2018-02-02 19:17:46,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-02 19:17:46,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-02 19:17:46,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 52 [2018-02-02 19:17:46,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-02 19:17:46,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-02 19:17:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-02 19:17:46,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:46,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-02 19:17:46,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-02 19:17:46,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-02-02 19:17:46,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:46,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-02 19:17:46,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-02-02 19:17:46,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-02-02 19:17:46,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:46,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-02 19:17:46,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-02-02 19:17:46,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-02-02 19:17:46,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:46,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-02 19:17:46,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-02-02 19:17:46,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:46,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-02-02 19:17:46,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:46,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:47,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:47,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-02 19:17:48,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-02-02 19:17:48,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:17:48,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-02-02 19:17:48,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:17:48,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:17:48,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-02 19:17:48,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-02 19:18:00,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2018-02-02 19:18:00,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:18:00,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 591 [2018-02-02 19:18:00,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:18:00,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:18:00,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-02 19:18:00,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 Received shutdown request... [2018-02-02 19:18:04,264 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 19:18:04,264 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:18:04,268 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:18:04,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:18:04 BoogieIcfgContainer [2018-02-02 19:18:04,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:18:04,268 INFO L168 Benchmark]: Toolchain (without parser) took 101591.21 ms. Allocated memory was 400.0 MB in the beginning and 729.3 MB in the end (delta: 329.3 MB). Free memory was 356.6 MB in the beginning and 467.2 MB in the end (delta: -110.6 MB). Peak memory consumption was 218.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:18:04,269 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:18:04,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.19 ms. Allocated memory is still 400.0 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:18:04,269 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 ms. Allocated memory is still 400.0 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:18:04,270 INFO L168 Benchmark]: RCFGBuilder took 206.31 ms. Allocated memory is still 400.0 MB. Free memory was 342.1 MB in the beginning and 318.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:18:04,270 INFO L168 Benchmark]: TraceAbstraction took 101186.03 ms. Allocated memory was 400.0 MB in the beginning and 729.3 MB in the end (delta: 329.3 MB). Free memory was 316.8 MB in the beginning and 467.2 MB in the end (delta: -150.5 MB). Peak memory consumption was 178.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:18:04,271 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.19 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.19 ms. Allocated memory is still 400.0 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.84 ms. Allocated memory is still 400.0 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.31 ms. Allocated memory is still 400.0 MB. Free memory was 342.1 MB in the beginning and 318.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 101186.03 ms. Allocated memory was 400.0 MB in the beginning and 729.3 MB in the end (delta: 329.3 MB). Free memory was 316.8 MB in the beginning and 467.2 MB in the end (delta: -150.5 MB). Peak memory consumption was 178.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 analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 101.1s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 74.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1231 SDtfs, 1115 SDslu, 7562 SDs, 0 SdLazy, 3932 SolverSat, 261 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 32.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 495 SyntacticMatches, 5 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 46.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1327 ConstructedInterpolants, 75 QuantifiedInterpolants, 505268 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1720 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1245/2250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-18-04-276.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-18-04-276.csv Completed graceful shutdown