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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:22:19,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:22:19,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:22:19,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:22:19,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:22:19,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:22:19,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:22:19,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:22:19,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:22:19,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:22:19,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:22:19,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:22:19,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:22:19,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:22:19,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:22:19,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:22:19,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:22:19,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:22:19,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:22:19,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:22:19,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:22:19,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:22:19,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:22:19,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:22:19,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:22:19,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:22:19,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:22:19,879 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:22:19,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:22:19,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:22:19,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:22:19,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:22:19,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:22:19,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:22:19,892 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:22:19,892 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:22:19,893 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:22:19,893 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:22:19,893 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:22:19,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:22:19,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:22:19,894 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:22:19,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:22:19,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:22:19,895 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:22:19,895 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:22:19,895 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:22:19,895 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:22:19,895 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:22:19,896 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:22:19,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:22:19,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:22:19,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:22:19,897 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:22:19,897 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:22:19,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:22:19,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:22:19,897 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:22:19,898 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:22:19,899 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:22:19,900 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:22:19,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:22:19,949 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:22:19,954 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:22:19,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:22:19,956 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:22:19,957 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-24 13:22:20,160 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:22:20,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:22:20,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:22:20,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:22:20,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:22:20,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20, skipping insertion in model container [2018-01-24 13:22:20,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,198 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:22:20,248 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:22:20,360 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:22:20,378 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:22:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20 WrapperNode [2018-01-24 13:22:20,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:22:20,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:22:20,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:22:20,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:22:20,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... [2018-01-24 13:22:20,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:22:20,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:22:20,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:22:20,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:22:20,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 13:22:20,469 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:22:20,470 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:22:20,470 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:22:20,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:22:20,769 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:22:20,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:22:20 BoogieIcfgContainer [2018-01-24 13:22:20,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:22:20,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:22:20,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:22:20,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:22:20,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:22:20" (1/3) ... [2018-01-24 13:22:20,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721362e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:22:20, skipping insertion in model container [2018-01-24 13:22:20,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:22:20" (2/3) ... [2018-01-24 13:22:20,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721362e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:22:20, skipping insertion in model container [2018-01-24 13:22:20,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:22:20" (3/3) ... [2018-01-24 13:22:20,775 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-24 13:22:20,782 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:22:20,790 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 13:22:20,835 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:22:20,835 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:22:20,835 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:22:20,835 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:22:20,835 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:22:20,836 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:22:20,836 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:22:20,836 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:22:20,836 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:22:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-24 13:22:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:22:20,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:20,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:20,860 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-24 13:22:20,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-24 13:22:20,866 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:20,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:20,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:20,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:20,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:20,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:21,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:21,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:22:21,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:21,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:22:21,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:22:21,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:22:21,164 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-24 13:22:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:21,369 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 13:22:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:22:21,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 13:22:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:21,386 INFO L225 Difference]: With dead ends: 178 [2018-01-24 13:22:21,386 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 13:22:21,390 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:22:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 13:22:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-24 13:22:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:22:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-24 13:22:21,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-24 13:22:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:21,442 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-24 13:22:21,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:22:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-24 13:22:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:22:21,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:21,443 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:21,444 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-24 13:22:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-24 13:22:21,444 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:21,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:21,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:21,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:21,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:21,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:22:21,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:21,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:22:21,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:22:21,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:22:21,531 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-24 13:22:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:21,568 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-24 13:22:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:22:21,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:22:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:21,570 INFO L225 Difference]: With dead ends: 136 [2018-01-24 13:22:21,570 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:22:21,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:22:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:22:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-24 13:22:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 13:22:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-24 13:22:21,582 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-24 13:22:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:21,582 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-24 13:22:21,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:22:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-24 13:22:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:22:21,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:21,584 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:21,584 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-24 13:22:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-24 13:22:21,584 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:21,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:21,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:21,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:21,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:21,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:22:21,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:21,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:22:21,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:22:21,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:22:21,654 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-24 13:22:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:21,711 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 13:22:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:22:21,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:22:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:21,714 INFO L225 Difference]: With dead ends: 75 [2018-01-24 13:22:21,714 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 13:22:21,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:22:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 13:22:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 13:22:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 13:22:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 13:22:21,723 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 13:22:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:21,724 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 13:22:21,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:22:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 13:22:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:22:21,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:21,725 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:21,725 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-24 13:22:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-24 13:22:21,725 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:21,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:21,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:21,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:21,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:21,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:22:21,812 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:21,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:22:21,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:22:21,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:22:21,813 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-24 13:22:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:21,921 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 13:22:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:22:21,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:22:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:21,922 INFO L225 Difference]: With dead ends: 71 [2018-01-24 13:22:21,923 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 13:22:21,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:22:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 13:22:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 13:22:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 13:22:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 13:22:21,931 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-24 13:22:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:21,932 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 13:22:21,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:22:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 13:22:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:22:21,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:21,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:21,933 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-24 13:22:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-24 13:22:21,933 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:21,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:21,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:21,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:21,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:22,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:22,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:22:22,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:22,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:22:22,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:22:22,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:22:22,299 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-24 13:22:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:22,518 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-24 13:22:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:22:22,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:22:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:22,520 INFO L225 Difference]: With dead ends: 130 [2018-01-24 13:22:22,520 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:22:22,521 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:22:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:22:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-24 13:22:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:22:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-24 13:22:22,529 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-24 13:22:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:22,530 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-24 13:22:22,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:22:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-24 13:22:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:22:22,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:22,531 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:22,531 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-24 13:22:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-24 13:22:22,532 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:22,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:22,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:22,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:22,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:22,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:22,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:22,866 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:22,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:22,875 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:22,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:22,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:22:22,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:23,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:22:23,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:23,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:23,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:22:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:23,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:23,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:23,838 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:23,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:23,844 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:23,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:23,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:22:23,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:23,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:22:23,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:23,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:23,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:22:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:23,935 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:26,662 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_ldv_malloc_#in~size| 4294967296))) (let ((.cse1 (< .cse4 4)) (.cse2 (<= 8 .cse4))) (and (or (forall ((v_prenex_2 Int)) (let ((.cse0 (* 4 v_prenex_2))) (or (<= 4 (mod .cse0 4294967296)) (not (= |c_ldv_malloc_#in~size| .cse0))))) .cse1 .cse2) (or .cse1 (forall ((v_entry_point_~len~12_BEFORE_CALL_2 Int)) (let ((.cse3 (* 4 v_entry_point_~len~12_BEFORE_CALL_2))) (or (< (mod .cse3 4294967296) 8) (not (= |c_ldv_malloc_#in~size| .cse3))))) .cse2)))) is different from true [2018-01-24 13:22:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:26,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:26,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 11] total 33 [2018-01-24 13:22:26,673 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:26,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:22:26,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:22:26,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=952, Unknown=1, NotChecked=62, Total=1122 [2018-01-24 13:22:26,675 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-24 13:22:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:27,084 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-24 13:22:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:22:27,084 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-24 13:22:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:27,085 INFO L225 Difference]: With dead ends: 135 [2018-01-24 13:22:27,085 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 13:22:27,086 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=211, Invalid=1432, Unknown=1, NotChecked=78, Total=1722 [2018-01-24 13:22:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 13:22:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 13:22:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 13:22:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 13:22:27,093 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-24 13:22:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:27,093 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 13:22:27,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 13:22:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 13:22:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:22:27,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:27,094 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-24 13:22:27,095 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-24 13:22:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-24 13:22:27,095 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:27,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 13:22:27,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:27,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:22:27,218 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:27,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:22:27,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:22:27,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:22:27,219 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-24 13:22:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:27,347 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-24 13:22:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:22:27,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-24 13:22:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:27,349 INFO L225 Difference]: With dead ends: 104 [2018-01-24 13:22:27,349 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 13:22:27,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:22:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 13:22:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-24 13:22:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 13:22:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-24 13:22:27,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-24 13:22:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:27,360 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-24 13:22:27,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:22:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-24 13:22:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:22:27,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:27,362 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-24 13:22:27,362 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-24 13:22:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-24 13:22:27,362 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:27,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:27,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:27,435 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:27,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,445 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:27,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:27,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:27,551 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:27,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,554 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 13:22:27,650 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 13:22:27,700 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 13:22:27,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-24 13:22:27,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:27,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:22:27,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:22:27,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:22:27,703 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-24 13:22:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:27,749 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-24 13:22:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:22:27,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 13:22:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:27,751 INFO L225 Difference]: With dead ends: 137 [2018-01-24 13:22:27,752 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 13:22:27,752 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:22:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 13:22:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-24 13:22:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 13:22:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-24 13:22:27,762 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-24 13:22:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:27,762 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-24 13:22:27,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:22:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-24 13:22:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:22:27,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:27,764 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:27,764 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-24 13:22:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-24 13:22:27,765 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:27,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,766 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:22:27,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:22:27,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:22:27,866 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:22:27,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:22:27,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:22:27,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:22:27,867 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-24 13:22:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:27,911 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-24 13:22:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:22:27,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 13:22:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:27,914 INFO L225 Difference]: With dead ends: 168 [2018-01-24 13:22:27,914 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 13:22:27,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:22:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 13:22:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-24 13:22:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 13:22:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-24 13:22:27,924 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-24 13:22:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:27,924 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-24 13:22:27,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:22:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-24 13:22:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:22:27,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:27,926 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:27,926 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-24 13:22:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-24 13:22:27,927 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:27,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:27,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:27,928 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:27,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:28,061 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:28,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:28,066 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:28,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:28,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:28,221 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:28,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:28,224 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:28,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:28,271 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:28,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-24 13:22:28,286 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:28,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:22:28,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:22:28,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:22:28,287 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 11 states. [2018-01-24 13:22:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:28,358 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-01-24 13:22:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:22:28,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 13:22:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:28,360 INFO L225 Difference]: With dead ends: 172 [2018-01-24 13:22:28,361 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 13:22:28,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:22:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 13:22:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-24 13:22:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 13:22:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-24 13:22:28,370 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 44 [2018-01-24 13:22:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:28,371 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-24 13:22:28,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:22:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-24 13:22:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:22:28,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:28,372 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:28,372 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-24 13:22:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -108654543, now seen corresponding path program 2 times [2018-01-24 13:22:28,373 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:28,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:28,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:28,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:28,374 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:28,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:28,455 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:28,463 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:22:28,464 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:22:28,477 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:28,488 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:28,491 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:28,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:28,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:28,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:28,704 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:22:28,705 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:22:28,721 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:28,741 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:28,755 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:28,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:28,771 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:28,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:28,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 19 [2018-01-24 13:22:28,808 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:28,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:22:28,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:22:28,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:22:28,809 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 13 states. [2018-01-24 13:22:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:28,889 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-01-24 13:22:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:22:28,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 13:22:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:28,891 INFO L225 Difference]: With dead ends: 176 [2018-01-24 13:22:28,891 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 13:22:28,892 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:22:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 13:22:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-24 13:22:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 13:22:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-24 13:22:28,901 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2018-01-24 13:22:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:28,901 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-24 13:22:28,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:22:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-24 13:22:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 13:22:28,902 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:28,902 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:28,903 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-24 13:22:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 3 times [2018-01-24 13:22:28,903 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:28,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:28,904 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:22:28,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:28,904 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:28,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:29,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:29,011 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:29,020 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:22:29,021 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:22:29,036 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:29,044 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:29,046 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:29,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:29,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:22:29,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:22:29,181 WARN L1029 $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-24 13:22:29,190 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-24 13:22:29,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:22:29,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 13:22:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 3 not checked. [2018-01-24 13:22:29,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 13:22:29,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:29,379 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:29,384 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:22:29,384 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:22:29,404 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:29,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:29,448 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:29,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:29,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:22:29,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:22:29,475 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-24 13:22:29,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:29,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:22:29,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 13:22:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 3 not checked. [2018-01-24 13:22:29,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 13:22:29,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:29,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 9, 8] total 18 [2018-01-24 13:22:29,634 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:29,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:22:29,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:22:29,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2018-01-24 13:22:29,635 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 17 states. [2018-01-24 13:22:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:30,065 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2018-01-24 13:22:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 13:22:30,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-01-24 13:22:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:30,067 INFO L225 Difference]: With dead ends: 209 [2018-01-24 13:22:30,067 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 13:22:30,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=776, Unknown=2, NotChecked=58, Total=992 [2018-01-24 13:22:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 13:22:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2018-01-24 13:22:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 13:22:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-01-24 13:22:30,079 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 52 [2018-01-24 13:22:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:30,080 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-01-24 13:22:30,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:22:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-01-24 13:22:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 13:22:30,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:30,081 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:30,081 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-24 13:22:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126724, now seen corresponding path program 1 times [2018-01-24 13:22:30,081 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:30,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:30,083 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:22:30,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:30,083 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:30,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:30,203 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:30,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:30,211 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:30,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:30,302 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:30,418 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:30,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:30,422 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:22:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:30,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:30,479 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:30,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 21 [2018-01-24 13:22:30,517 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:30,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:22:30,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:22:30,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:22:30,518 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 17 states. [2018-01-24 13:22:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:30,582 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-01-24 13:22:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:22:30,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-01-24 13:22:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:30,584 INFO L225 Difference]: With dead ends: 200 [2018-01-24 13:22:30,584 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 13:22:30,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:22:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 13:22:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-24 13:22:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 13:22:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-24 13:22:30,593 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 56 [2018-01-24 13:22:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:30,594 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-24 13:22:30,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:22:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-24 13:22:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 13:22:30,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:30,595 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:30,595 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-24 13:22:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -429538227, now seen corresponding path program 2 times [2018-01-24 13:22:30,595 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:30,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:30,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:22:30,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:30,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:30,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:30,695 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:22:30,701 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:22:30,701 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:22:30,712 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:30,721 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:30,723 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:30,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:30,786 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:30,864 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:30,867 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:22:30,867 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:22:30,882 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:30,904 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:22:30,920 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:30,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:22:30,934 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:30,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:30,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 22 [2018-01-24 13:22:30,982 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:30,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:22:30,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:22:30,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:22:30,983 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 19 states. [2018-01-24 13:22:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:22:31,064 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2018-01-24 13:22:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:22:31,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 13:22:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:22:31,065 INFO L225 Difference]: With dead ends: 204 [2018-01-24 13:22:31,065 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 13:22:31,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 217 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:22:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 13:22:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-24 13:22:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 13:22:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-01-24 13:22:31,074 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 60 [2018-01-24 13:22:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:22:31,074 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-01-24 13:22:31,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 13:22:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-01-24 13:22:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 13:22:31,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:22:31,075 INFO L322 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:22:31,075 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-24 13:22:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 3 times [2018-01-24 13:22:31,076 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:22:31,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:31,077 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:22:31,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:22:31,077 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:22:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:22:31,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:22:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:22:31,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:31,284 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:22:31,291 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:22:31,292 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:22:31,305 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:31,310 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:31,313 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:31,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:31,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 13:22:31,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 13:22:31,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:22:31,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 13:22:31,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:31,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 13:22:31,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-24 13:22:31,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:22:31,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-24 13:22:31,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:31,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 13:22:31,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:31,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 13:22:31,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 13:22:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 13:22:31,731 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:31,854 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 13:22:32,096 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 13:22:32,106 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 13:22:34,225 WARN L146 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 73 DAG size of output 41 [2018-01-24 13:22:34,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-24 13:22:34,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:34,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 28 [2018-01-24 13:22:34,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:34,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-24 13:22:34,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2018-01-24 13:22:34,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:34,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:34,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:34,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 13:22:35,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 52 treesize of output 46 [2018-01-24 13:22:35,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 13:22:35,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 5 [2018-01-24 13:22:35,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 34 [2018-01-24 13:22:35,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:22:35,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 13:22:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 13:22:35,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:22:35,751 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:22:35,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:22:35,754 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:22:35,767 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:35,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:22:35,796 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:22:35,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:22:35,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 13:22:35,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:22:35,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 13:22:35,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 13:22:35,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:35,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 13:22:35,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:35,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-24 13:22:35,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:35,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:35,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:35,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-24 13:22:35,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:36,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:36,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:36,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:22:36,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:36,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:36,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:22:36,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 13:22:36,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:36,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 13:22:36,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 13:22:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 13:22:36,132 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:22:36,242 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 13:22:40,579 WARN L146 SmtUtils]: Spent 2086ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 13:22:40,588 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 13:22:45,678 WARN L146 SmtUtils]: Spent 631ms on a formula simplification. DAG size of input: 73 DAG size of output 41 [2018-01-24 13:22:45,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-24 13:22:45,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2018-01-24 13:22:45,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:45,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:45,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-24 13:22:45,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:45,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-24 13:22:45,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:45,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:22:45,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 13:22:48,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 34 [2018-01-24 13:22:48,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:48,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-24 13:22:48,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 5 [2018-01-24 13:22:48,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:48,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:22:48,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 34 [2018-01-24 13:22:48,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:22:48,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:22:48,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 13:22:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 13:22:48,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:22:48,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 36 [2018-01-24 13:22:48,616 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:22:48,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 13:22:48,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 13:22:48,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1133, Unknown=5, NotChecked=0, Total=1260 [2018-01-24 13:22:48,617 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 23 states. [2018-01-24 13:23:08,092 WARN L143 SmtUtils]: Spent 14116ms on a formula simplification that was a NOOP. DAG size: 52 Received shutdown request... [2018-01-24 13:23:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 13:23:28,731 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:23:28,736 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:23:28,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:23:28 BoogieIcfgContainer [2018-01-24 13:23:28,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:23:28,737 INFO L168 Benchmark]: Toolchain (without parser) took 68576.51 ms. Allocated memory was 304.1 MB in the beginning and 593.5 MB in the end (delta: 289.4 MB). Free memory was 263.1 MB in the beginning and 537.4 MB in the end (delta: -274.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:23:28,738 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:23:28,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.91 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 249.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:23:28,739 INFO L168 Benchmark]: Boogie Preprocessor took 32.72 ms. Allocated memory is still 304.1 MB. Free memory was 249.2 MB in the beginning and 248.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 13:23:28,739 INFO L168 Benchmark]: RCFGBuilder took 350.56 ms. Allocated memory is still 304.1 MB. Free memory was 248.2 MB in the beginning and 226.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-01-24 13:23:28,739 INFO L168 Benchmark]: TraceAbstraction took 67966.18 ms. Allocated memory was 304.1 MB in the beginning and 593.5 MB in the end (delta: 289.4 MB). Free memory was 226.3 MB in the beginning and 537.4 MB in the end (delta: -311.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:23:28,741 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.91 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 249.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.72 ms. Allocated memory is still 304.1 MB. Free memory was 249.2 MB in the beginning and 248.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 350.56 ms. Allocated memory is still 304.1 MB. Free memory was 248.2 MB in the beginning and 226.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67966.18 ms. Allocated memory was 304.1 MB in the beginning and 593.5 MB in the end (delta: 289.4 MB). Free memory was 226.3 MB in the beginning and 537.4 MB in the end (delta: -311.1 MB). There was no memory consumed. 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 constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 67.9s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 42.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 986 SDtfs, 694 SDslu, 4736 SDs, 0 SdLazy, 1909 SolverSat, 158 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1694 GetRequests, 1403 SyntacticMatches, 43 SemanticMatches, 247 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 39.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 123 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2049 ConstructedInterpolants, 145 QuantifiedInterpolants, 750705 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2440 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 47 InterpolantComputations, 9 PerfectInterpolantSequences, 938/2315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-23-28-748.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-23-28-748.csv Completed graceful shutdown