java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:57:11,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:57:11,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:57:11,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:57:11,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:57:11,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:57:11,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:57:11,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:57:11,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:57:11,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:57:11,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:57:11,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:57:11,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:57:11,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:57:11,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:57:11,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:57:11,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:57:11,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:57:11,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:57:11,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:57:11,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:57:11,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:57:11,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:57:11,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:57:11,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:57:11,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:57:11,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:57:11,373 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:57:11,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:57:11,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:57:11,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:57:11,374 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:57:11,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:57:11,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:57:11,386 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:57:11,386 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:57:11,386 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:57:11,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:57:11,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:57:11,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:57:11,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:57:11,387 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:57:11,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:57:11,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:57:11,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:57:11,388 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:57:11,388 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:57:11,389 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:57:11,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:57:11,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:57:11,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:57:11,389 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:57:11,390 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:57:11,390 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:57:11,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:57:11,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:57:11,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:57:11,391 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:57:11,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:57:11,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:57:11,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:57:11,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:57:11,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:57:11,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:57:11,393 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:57:11,393 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:57:11,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:57:11,443 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:57:11,447 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:57:11,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:57:11,449 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:57:11,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-29 23:57:11,651 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:57:11,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:57:11,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:57:11,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:57:11,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:57:11,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ad0665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11, skipping insertion in model container [2018-01-29 23:57:11,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,693 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:57:11,750 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:57:11,861 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:57:11,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:57:11,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11 WrapperNode [2018-01-29 23:57:11,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:57:11,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:57:11,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:57:11,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:57:11,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... [2018-01-29 23:57:11,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:57:11,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:57:11,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:57:11,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:57:11,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:57:11,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-29 23:57:11,981 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:57:11,981 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:57:11,981 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:57:11,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-29 23:57:11,982 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-29 23:57:11,983 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:57:11,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:57:11,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:57:12,296 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:57:12,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:57:12 BoogieIcfgContainer [2018-01-29 23:57:12,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:57:12,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:57:12,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:57:12,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:57:12,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:57:11" (1/3) ... [2018-01-29 23:57:12,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9cc02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:57:12, skipping insertion in model container [2018-01-29 23:57:12,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:57:11" (2/3) ... [2018-01-29 23:57:12,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9cc02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:57:12, skipping insertion in model container [2018-01-29 23:57:12,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:57:12" (3/3) ... [2018-01-29 23:57:12,304 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-29 23:57:12,311 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:57:12,319 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-29 23:57:12,367 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:57:12,367 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:57:12,367 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:57:12,368 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:57:12,368 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:57:12,368 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:57:12,368 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:57:12,368 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:57:12,369 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:57:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-29 23:57:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:57:12,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:12,400 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:12,400 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1597802234, now seen corresponding path program 1 times [2018-01-29 23:57:12,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:12,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:12,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:12,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:12,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:12,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:12,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:12,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:57:12,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:57:12,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:57:12,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:57:12,734 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2018-01-29 23:57:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:12,899 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2018-01-29 23:57:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:57:12,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-29 23:57:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:12,914 INFO L225 Difference]: With dead ends: 230 [2018-01-29 23:57:12,914 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 23:57:12,919 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:57:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 23:57:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2018-01-29 23:57:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 23:57:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-29 23:57:12,970 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 23 [2018-01-29 23:57:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:12,971 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-29 23:57:12,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:57:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-29 23:57:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:57:12,973 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:12,973 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:12,973 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash -442809342, now seen corresponding path program 1 times [2018-01-29 23:57:12,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:12,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:12,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:12,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:12,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:13,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:13,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:13,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:57:13,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:57:13,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:57:13,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:57:13,068 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 6 states. [2018-01-29 23:57:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:13,218 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2018-01-29 23:57:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:57:13,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-29 23:57:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:13,220 INFO L225 Difference]: With dead ends: 120 [2018-01-29 23:57:13,220 INFO L226 Difference]: Without dead ends: 116 [2018-01-29 23:57:13,221 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:57:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-29 23:57:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-29 23:57:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-29 23:57:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-29 23:57:13,229 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 24 [2018-01-29 23:57:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:13,230 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-29 23:57:13,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:57:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-29 23:57:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:57:13,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:13,231 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:13,231 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2007837378, now seen corresponding path program 1 times [2018-01-29 23:57:13,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:13,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:13,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:13,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:13,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:13,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:13,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:13,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:57:13,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:57:13,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:57:13,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:57:13,315 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-01-29 23:57:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:13,347 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-01-29 23:57:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:57:13,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-29 23:57:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:13,349 INFO L225 Difference]: With dead ends: 180 [2018-01-29 23:57:13,349 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 23:57:13,350 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:57:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 23:57:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-29 23:57:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-29 23:57:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-29 23:57:13,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 24 [2018-01-29 23:57:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:13,357 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-29 23:57:13,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:57:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-29 23:57:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:57:13,358 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:13,358 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:13,358 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash -842088634, now seen corresponding path program 1 times [2018-01-29 23:57:13,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:13,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:13,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:13,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:13,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:13,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:57:13,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:57:13,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:57:13,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:57:13,701 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-01-29 23:57:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:14,019 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-29 23:57:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:57:14,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-29 23:57:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:14,022 INFO L225 Difference]: With dead ends: 177 [2018-01-29 23:57:14,022 INFO L226 Difference]: Without dead ends: 102 [2018-01-29 23:57:14,023 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:57:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-29 23:57:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-29 23:57:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 23:57:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-29 23:57:14,034 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 25 [2018-01-29 23:57:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:14,034 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-29 23:57:14,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:57:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-29 23:57:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:57:14,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:14,036 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:14,036 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash -842088635, now seen corresponding path program 1 times [2018-01-29 23:57:14,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:14,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:14,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:14,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:14,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:14,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:14,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:14,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:57:14,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:57:14,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:57:14,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:57:14,103 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 6 states. [2018-01-29 23:57:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:14,227 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-29 23:57:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:57:14,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-29 23:57:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:14,230 INFO L225 Difference]: With dead ends: 99 [2018-01-29 23:57:14,230 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 23:57:14,231 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:57:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 23:57:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-29 23:57:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 23:57:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 23:57:14,241 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-01-29 23:57:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:14,241 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 23:57:14,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:57:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 23:57:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:57:14,242 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:14,242 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:57:14,243 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1945442076, now seen corresponding path program 1 times [2018-01-29 23:57:14,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:14,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:14,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:14,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:14,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:14,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:14,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:14,550 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:14,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:14,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:14,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:57:14,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:14,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-29 23:57:14,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:14,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:57:14,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-29 23:57:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:15,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:15,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-29 23:57:15,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:57:15,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:57:15,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:57:15,116 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 20 states. [2018-01-29 23:57:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:15,556 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-01-29 23:57:15,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:57:15,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-29 23:57:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:15,558 INFO L225 Difference]: With dead ends: 181 [2018-01-29 23:57:15,558 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 23:57:15,559 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:57:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 23:57:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-01-29 23:57:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 23:57:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-01-29 23:57:15,565 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 31 [2018-01-29 23:57:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:15,566 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-01-29 23:57:15,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:57:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-01-29 23:57:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:57:15,567 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:15,567 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:15,567 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -600590734, now seen corresponding path program 2 times [2018-01-29 23:57:15,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:15,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:15,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:15,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:15,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:15,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:15,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:15,886 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:15,897 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:57:15,912 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:15,921 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:15,922 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:15,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:15,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:57:15,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:15,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-29 23:57:15,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:16,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:57:16,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-29 23:57:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:16,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:16,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-01-29 23:57:16,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:57:16,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:57:16,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:57:16,377 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 26 states. [2018-01-29 23:57:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:17,310 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2018-01-29 23:57:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:57:17,311 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-01-29 23:57:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:17,312 INFO L225 Difference]: With dead ends: 186 [2018-01-29 23:57:17,312 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 23:57:17,314 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:57:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 23:57:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-01-29 23:57:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-29 23:57:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-29 23:57:17,323 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 37 [2018-01-29 23:57:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:17,324 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-29 23:57:17,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:57:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-29 23:57:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:57:17,326 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:17,326 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:17,326 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818454, now seen corresponding path program 1 times [2018-01-29 23:57:17,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:17,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:17,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:17,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:57:17,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:17,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:57:17,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:17,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:57:17,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:57:17,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:57:17,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:57:17,395 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 5 states. [2018-01-29 23:57:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:17,512 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2018-01-29 23:57:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:57:17,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-01-29 23:57:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:17,514 INFO L225 Difference]: With dead ends: 134 [2018-01-29 23:57:17,514 INFO L226 Difference]: Without dead ends: 133 [2018-01-29 23:57:17,515 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:57:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-29 23:57:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-01-29 23:57:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 23:57:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-29 23:57:17,525 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 54 [2018-01-29 23:57:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:17,559 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-29 23:57:17,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:57:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-29 23:57:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:57:17,560 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:17,561 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:17,561 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818453, now seen corresponding path program 1 times [2018-01-29 23:57:17,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:17,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:17,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:17,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:17,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:17,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:17,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:17,654 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:17,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:17,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:17,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:17,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-29 23:57:17,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:57:17,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:57:17,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:57:17,896 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 17 states. [2018-01-29 23:57:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:18,038 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-01-29 23:57:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:57:18,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-01-29 23:57:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:18,039 INFO L225 Difference]: With dead ends: 199 [2018-01-29 23:57:18,039 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 23:57:18,040 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:57:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 23:57:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-29 23:57:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 23:57:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-29 23:57:18,051 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 54 [2018-01-29 23:57:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:18,051 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-29 23:57:18,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:57:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-29 23:57:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:57:18,053 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:18,053 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1] [2018-01-29 23:57:18,053 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1982886101, now seen corresponding path program 2 times [2018-01-29 23:57:18,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:18,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:18,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:18,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:18,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:18,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:18,161 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:18,169 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:57:18,185 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:18,186 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:18,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:57:18,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:57:18,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2018-01-29 23:57:18,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:57:18,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:57:18,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:57:18,315 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 15 states. [2018-01-29 23:57:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:18,552 INFO L93 Difference]: Finished difference Result 232 states and 253 transitions. [2018-01-29 23:57:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:57:18,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-01-29 23:57:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:18,554 INFO L225 Difference]: With dead ends: 232 [2018-01-29 23:57:18,554 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:57:18,554 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:57:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:57:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2018-01-29 23:57:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-29 23:57:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-29 23:57:18,564 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 60 [2018-01-29 23:57:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:18,564 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-29 23:57:18,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:57:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-29 23:57:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 23:57:18,565 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:18,565 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:18,566 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1687986405, now seen corresponding path program 1 times [2018-01-29 23:57:18,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:18,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:18,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,567 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:57:18,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:18,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-01-29 23:57:18,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:57:18,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:57:18,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:57:18,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:57:18,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:57:18,686 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-01-29 23:57:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:18,772 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2018-01-29 23:57:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:57:18,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-01-29 23:57:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:18,774 INFO L225 Difference]: With dead ends: 216 [2018-01-29 23:57:18,774 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 23:57:18,775 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:57:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 23:57:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 129. [2018-01-29 23:57:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-29 23:57:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-29 23:57:18,782 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 74 [2018-01-29 23:57:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:18,783 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-29 23:57:18,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:57:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-29 23:57:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:57:18,783 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:18,783 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:18,784 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1026474647, now seen corresponding path program 1 times [2018-01-29 23:57:18,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:18,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:18,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:18,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:18,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:57:19,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:19,037 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:19,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:19,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:19,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:19,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-29 23:57:19,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:57:19,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:57:19,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:57:19,220 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 25 states. [2018-01-29 23:57:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:19,393 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-01-29 23:57:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:57:19,395 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-29 23:57:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:19,396 INFO L225 Difference]: With dead ends: 221 [2018-01-29 23:57:19,396 INFO L226 Difference]: Without dead ends: 138 [2018-01-29 23:57:19,397 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:57:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-29 23:57:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-01-29 23:57:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-29 23:57:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-01-29 23:57:19,405 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 75 [2018-01-29 23:57:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:19,406 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-01-29 23:57:19,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:57:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-01-29 23:57:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 23:57:19,406 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:19,406 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:19,407 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 283030463, now seen corresponding path program 2 times [2018-01-29 23:57:19,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:19,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:19,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:19,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:19,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:19,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:57:19,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:19,625 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:19,636 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:57:19,649 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:19,661 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:19,663 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:19,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:19,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:19,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-29 23:57:19,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:57:19,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:57:19,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:57:19,903 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 29 states. [2018-01-29 23:57:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:20,147 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-01-29 23:57:20,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:57:20,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-29 23:57:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:20,149 INFO L225 Difference]: With dead ends: 227 [2018-01-29 23:57:20,149 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 23:57:20,150 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:57:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 23:57:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-01-29 23:57:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-29 23:57:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-29 23:57:20,160 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 81 [2018-01-29 23:57:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:20,161 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-29 23:57:20,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:57:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-29 23:57:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:57:20,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:20,162 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:20,162 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -975990379, now seen corresponding path program 3 times [2018-01-29 23:57:20,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:20,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:20,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:20,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:57:20,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:20,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:57:20,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:20,445 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:20,451 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:57:20,465 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:57:20,471 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:57:20,473 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:20,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:20,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:57:20,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:20,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:57:20,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:57:20,567 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-29 23:57:20,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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-01-29 23:57:20,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:20,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:57:20,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-29 23:57:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 3 not checked. [2018-01-29 23:57:20,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:20,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 26 [2018-01-29 23:57:20,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:57:20,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:57:20,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2018-01-29 23:57:20,626 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 26 states. [2018-01-29 23:57:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:21,403 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-01-29 23:57:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:57:21,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-01-29 23:57:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:21,405 INFO L225 Difference]: With dead ends: 272 [2018-01-29 23:57:21,405 INFO L226 Difference]: Without dead ends: 189 [2018-01-29 23:57:21,406 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=589, Invalid=2493, Unknown=2, NotChecked=108, Total=3192 [2018-01-29 23:57:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-29 23:57:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2018-01-29 23:57:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-29 23:57:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-29 23:57:21,419 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 87 [2018-01-29 23:57:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:21,420 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-29 23:57:21,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:57:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-29 23:57:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:57:21,420 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:21,421 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:21,421 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash -312199444, now seen corresponding path program 1 times [2018-01-29 23:57:21,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:21,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:21,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:21,422 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:57:21,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:21,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:57:21,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:21,672 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:21,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:21,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:21,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:21,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-01-29 23:57:21,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:57:21,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:57:21,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:57:21,943 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 37 states. [2018-01-29 23:57:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:22,270 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2018-01-29 23:57:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:57:22,270 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-01-29 23:57:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:22,271 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:57:22,272 INFO L226 Difference]: Without dead ends: 165 [2018-01-29 23:57:22,273 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1970, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:57:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-29 23:57:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-01-29 23:57:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-29 23:57:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-29 23:57:22,283 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 93 [2018-01-29 23:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:22,284 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-29 23:57:22,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:57:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-29 23:57:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:57:22,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:22,284 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:22,285 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1383924674, now seen corresponding path program 2 times [2018-01-29 23:57:22,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:22,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:22,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:22,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:57:22,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:22,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:57:22,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:22,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:22,599 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:57:22,613 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:22,627 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:57:22,629 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:22,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:57:22,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:22,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-29 23:57:22,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:57:22,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:57:22,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:57:22,893 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 41 states. [2018-01-29 23:57:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:57:23,304 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-29 23:57:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:57:23,304 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-29 23:57:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:57:23,305 INFO L225 Difference]: With dead ends: 263 [2018-01-29 23:57:23,305 INFO L226 Difference]: Without dead ends: 171 [2018-01-29 23:57:23,307 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 23:57:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-29 23:57:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-29 23:57:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-29 23:57:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-01-29 23:57:23,316 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 99 [2018-01-29 23:57:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:57:23,317 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-01-29 23:57:23,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:57:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-01-29 23:57:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-29 23:57:23,318 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:57:23,318 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:57:23,318 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:57:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash 893540376, now seen corresponding path program 3 times [2018-01-29 23:57:23,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:57:23,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:57:23,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:23,319 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:57:23,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:57:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:57:23,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:57:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-29 23:57:23,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:57:23,988 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:57:23,993 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:57:24,005 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:57:24,010 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:57:24,012 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:57:24,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:57:24,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-29 23:57:24,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-29 23:57:24,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-29 23:57:24,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-29 23:57:24,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:57:24,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-29 23:57:24,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-29 23:57:24,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-29 23:57:24,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-29 23:57:24,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:57:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-29 23:57:24,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:57:24,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-29 23:57:24,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-29 23:57:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-29 23:57:24,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:57:24,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-01-29 23:57:24,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:57:24,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:57:24,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1158, Unknown=1, NotChecked=0, Total=1260 [2018-01-29 23:57:24,716 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 36 states. [2018-01-29 23:57:25,079 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-29 23:57:50,614 WARN L143 SmtUtils]: Spent 14269ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-29 23:58:10,846 WARN L146 SmtUtils]: Spent 20168ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-01-29 23:58:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:58:11,340 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2018-01-29 23:58:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:58:11,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 105 [2018-01-29 23:58:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:58:11,342 INFO L225 Difference]: With dead ends: 276 [2018-01-29 23:58:11,342 INFO L226 Difference]: Without dead ends: 274 [2018-01-29 23:58:11,343 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=516, Invalid=3770, Unknown=4, NotChecked=0, Total=4290 [2018-01-29 23:58:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-29 23:58:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 172. [2018-01-29 23:58:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-29 23:58:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-01-29 23:58:11,359 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 105 [2018-01-29 23:58:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:58:11,360 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-01-29 23:58:11,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:58:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-01-29 23:58:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-29 23:58:11,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:58:11,361 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:58:11,361 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:58:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1266036338, now seen corresponding path program 1 times [2018-01-29 23:58:11,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:58:11,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:58:11,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:11,362 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:58:11,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:11,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:58:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-29 23:58:11,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:58:11,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:58:11,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:58:11,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:58:11,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:58:11,413 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 4 states. [2018-01-29 23:58:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:58:11,548 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-01-29 23:58:11,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:58:11,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-29 23:58:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:58:11,550 INFO L225 Difference]: With dead ends: 230 [2018-01-29 23:58:11,550 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 23:58:11,550 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:58:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 23:58:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-01-29 23:58:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-29 23:58:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-29 23:58:11,566 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 107 [2018-01-29 23:58:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:58:11,567 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-29 23:58:11,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:58:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-29 23:58:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-29 23:58:11,567 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:58:11,568 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:58:11,568 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:58:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1171291026, now seen corresponding path program 1 times [2018-01-29 23:58:11,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:58:11,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:58:11,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:11,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:58:11,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:11,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:58:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-29 23:58:12,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:58:12,216 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:58:12,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:58:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:12,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:58:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-29 23:58:12,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:58:12,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-01-29 23:58:12,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:58:12,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:58:12,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:58:12,708 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 20 states. [2018-01-29 23:58:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:58:13,393 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-01-29 23:58:13,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:58:13,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2018-01-29 23:58:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:58:13,395 INFO L225 Difference]: With dead ends: 277 [2018-01-29 23:58:13,396 INFO L226 Difference]: Without dead ends: 220 [2018-01-29 23:58:13,396 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:58:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-29 23:58:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2018-01-29 23:58:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 23:58:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2018-01-29 23:58:13,424 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 114 [2018-01-29 23:58:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:58:13,425 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2018-01-29 23:58:13,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:58:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2018-01-29 23:58:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-29 23:58:13,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:58:13,426 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:58:13,426 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:58:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528742, now seen corresponding path program 1 times [2018-01-29 23:58:13,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:58:13,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:58:13,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:13,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:58:13,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:13,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:58:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-01-29 23:58:13,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:58:13,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:58:13,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:58:13,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:58:13,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:58:13,528 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand 6 states. [2018-01-29 23:58:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:58:13,667 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-29 23:58:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:58:13,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-29 23:58:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:58:13,669 INFO L225 Difference]: With dead ends: 213 [2018-01-29 23:58:13,670 INFO L226 Difference]: Without dead ends: 212 [2018-01-29 23:58:13,670 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-01-29 23:58:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-29 23:58:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2018-01-29 23:58:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-29 23:58:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2018-01-29 23:58:13,701 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 119 [2018-01-29 23:58:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:58:13,701 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2018-01-29 23:58:13,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:58:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2018-01-29 23:58:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-29 23:58:13,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:58:13,703 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:58:13,703 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:58:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528741, now seen corresponding path program 1 times [2018-01-29 23:58:13,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:58:13,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:58:13,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:13,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:58:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:58:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:13,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:58:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-29 23:58:14,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:58:14,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:58:14,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:58:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:58:14,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:58:14,290 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-01-29 23:58:14,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:58:14,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-29 23:58:14,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:58:14,314 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-01-29 23:58:14,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-29 23:58:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:58:26,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:58:26,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-29 23:58:26,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-29 23:58:26,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-29 23:58:26,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2049, Unknown=3, NotChecked=0, Total=2256 [2018-01-29 23:58:26,565 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand 48 states. [2018-01-29 23:58:32,870 WARN L143 SmtUtils]: Spent 6038ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-29 23:58:39,019 WARN L143 SmtUtils]: Spent 3963ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-29 23:58:46,224 WARN L146 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 49 DAG size of output 44 [2018-01-29 23:58:49,028 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-01-29 23:58:49,268 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-01-29 23:58:51,829 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-01-29 23:58:52,000 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 44 DAG size of output 43 [2018-01-29 23:58:59,517 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-29 23:59:02,483 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-29 23:59:03,192 WARN L146 SmtUtils]: Spent 651ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-01-29 23:59:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:17,444 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-01-29 23:59:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:59:17,444 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-01-29 23:59:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:17,445 INFO L225 Difference]: With dead ends: 227 [2018-01-29 23:59:17,446 INFO L226 Difference]: Without dead ends: 226 [2018-01-29 23:59:17,448 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=1194, Invalid=7542, Unknown=6, NotChecked=0, Total=8742 [2018-01-29 23:59:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-29 23:59:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2018-01-29 23:59:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:59:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2018-01-29 23:59:17,468 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 119 [2018-01-29 23:59:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:17,468 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2018-01-29 23:59:17,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-29 23:59:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2018-01-29 23:59:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-29 23:59:17,469 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:17,469 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:17,469 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:59:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1805836304, now seen corresponding path program 1 times [2018-01-29 23:59:17,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:17,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:17,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:17,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:17,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:17,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-29 23:59:17,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:17,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:59:17,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:17,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:17,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:17,572 INFO L87 Difference]: Start difference. First operand 211 states and 231 transitions. Second operand 6 states. [2018-01-29 23:59:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:17,735 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-01-29 23:59:17,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:59:17,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-01-29 23:59:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:17,738 INFO L225 Difference]: With dead ends: 290 [2018-01-29 23:59:17,738 INFO L226 Difference]: Without dead ends: 230 [2018-01-29 23:59:17,738 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-29 23:59:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 208. [2018-01-29 23:59:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-29 23:59:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-01-29 23:59:17,758 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 120 [2018-01-29 23:59:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:17,758 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-01-29 23:59:17,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-01-29 23:59:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-29 23:59:17,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:17,759 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:17,759 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-29 23:59:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1111347431, now seen corresponding path program 1 times [2018-01-29 23:59:17,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:17,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:17,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:17,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:17,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:17,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:18,765 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-01-29 23:59:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 90 proven. 204 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 23:59:20,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:20,427 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:20,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:20,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:20,600 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-01-29 23:59:20,601 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-01-29 23:59:20,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-01-29 23:59:20,714 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-01-29 23:59:20,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:20,717 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-01-29 23:59:20,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:59:20,851 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-01-29 23:59:20,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:20,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:20,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:20,855 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-01-29 23:59:20,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:20,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-29 23:59:21,047 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-01-29 23:59:21,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,083 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-01-29 23:59:21,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,107 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-01-29 23:59:21,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-01-29 23:59:21,340 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-01-29 23:59:21,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,363 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-01-29 23:59:21,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,395 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-01-29 23:59:21,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-29 23:59:21,722 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-01-29 23:59:21,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:21,741 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-01-29 23:59:21,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:21,785 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-01-29 23:59:21,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-01-29 23:59:22,142 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-01-29 23:59:22,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,242 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-01-29 23:59:22,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:22,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:22,308 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-01-29 23:59:22,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-01-29 23:59:22,857 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-01-29 23:59:22,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:22,904 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-01-29 23:59:22,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:22,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:22,987 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-01-29 23:59:22,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-01-29 23:59:26,709 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-01-29 23:59:26,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:26,751 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-01-29 23:59:26,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:26,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:26,853 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-01-29 23:59:26,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 Received shutdown request... [2018-01-29 23:59:34,097 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:59:34,098 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:59:34,102 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:59:34,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:59:34 BoogieIcfgContainer [2018-01-29 23:59:34,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:59:34,103 INFO L168 Benchmark]: Toolchain (without parser) took 142450.69 ms. Allocated memory was 305.7 MB in the beginning and 694.2 MB in the end (delta: 388.5 MB). Free memory was 264.7 MB in the beginning and 465.1 MB in the end (delta: -200.4 MB). Peak memory consumption was 188.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:59:34,104 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:59:34,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.34 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:59:34,105 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 249.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-29 23:59:34,105 INFO L168 Benchmark]: RCFGBuilder took 373.12 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 225.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:59:34,105 INFO L168 Benchmark]: TraceAbstraction took 141804.98 ms. Allocated memory was 305.7 MB in the beginning and 694.2 MB in the end (delta: 388.5 MB). Free memory was 225.2 MB in the beginning and 465.1 MB in the end (delta: -239.9 MB). Peak memory consumption was 148.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:59:34,107 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.24 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.34 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.38 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 249.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 373.12 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 225.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 141804.98 ms. Allocated memory was 305.7 MB in the beginning and 694.2 MB in the end (delta: 388.5 MB). Free memory was 225.2 MB in the beginning and 465.1 MB in the end (delta: -239.9 MB). Peak memory consumption was 148.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 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 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 97 locations, 15 error locations. TIMEOUT Result, 141.7s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 103.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2055 SDtfs, 2377 SDslu, 16423 SDs, 0 SdLazy, 6757 SolverSat, 423 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 39.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 847 SyntacticMatches, 4 SemanticMatches, 593 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7312 ImplicationChecksByTransitivity, 79.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=21, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 384 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2379 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2471 ConstructedInterpolants, 104 QuantifiedInterpolants, 1484198 SizeOfPredicates, 139 NumberOfNonLiveVariables, 2247 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 2653/4479 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-59-34-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-59-34-115.csv Completed graceful shutdown