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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:15,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:15,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:15,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:15,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:15,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:15,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:15,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:15,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:15,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:15,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:15,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:15,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:15,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:15,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:15,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:15,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:15,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:15,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:15,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:15,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:15,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:15,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:15,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:15,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:15,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:15,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:15,918 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:15,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:15,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:15,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:15,919 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:47:15,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:15,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:15,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:15,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:15,930 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:15,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:15,931 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:15,932 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:15,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:15,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:15,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:15,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:15,932 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:15,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:15,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:15,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:15,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:15,933 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:15,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:15,975 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:15,978 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:15,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:15,980 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:15,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-02-02 10:47:16,116 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:16,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:16,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:16,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:16,127 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:16,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16, skipping insertion in model container [2018-02-02 10:47:16,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,147 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:16,182 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:16,267 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:16,280 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:16,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16 WrapperNode [2018-02-02 10:47:16,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:16,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:16,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:16,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:16,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... [2018-02-02 10:47:16,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:16,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:16,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:16,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:16,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:16,344 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:16,344 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:16,344 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:16,344 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:47:16,344 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:47:16,345 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:16,345 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:47:16,345 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:47:16,346 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:16,346 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:16,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:16,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:16,572 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:16,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:16 BoogieIcfgContainer [2018-02-02 10:47:16,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:16,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:16,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:16,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:16,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:16" (1/3) ... [2018-02-02 10:47:16,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71632211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:16, skipping insertion in model container [2018-02-02 10:47:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:16" (2/3) ... [2018-02-02 10:47:16,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71632211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:16, skipping insertion in model container [2018-02-02 10:47:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:16" (3/3) ... [2018-02-02 10:47:16,580 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 10:47:16,586 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:16,591 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 10:47:16,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:16,615 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:16,615 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:16,615 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:16,615 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:16,615 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:16,615 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:16,615 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:16,616 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 10:47:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:16,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:16,634 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:16,635 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 10:47:16,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:16,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:16,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:16,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:16,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:16,785 INFO L182 omatonBuilderFactory]: Interpolants [76#true, 77#false, 78#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:16,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:16,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:16,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:16,882 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 10:47:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:17,025 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 10:47:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:17,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:47:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:17,038 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:47:17,038 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:47:17,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:47:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 10:47:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:47:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 10:47:17,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 10:47:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:17,084 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 10:47:17,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 10:47:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:17,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:17,086 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:17,086 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 10:47:17,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:17,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:17,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:17,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,154 INFO L182 omatonBuilderFactory]: Interpolants [299#true, 300#false, 301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 302#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 303#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:47:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:17,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:17,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:17,156 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 10:47:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:17,181 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 10:47:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:17,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:47:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:17,183 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:47:17,183 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:47:17,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:47:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 10:47:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:47:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 10:47:17,190 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 10:47:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:17,190 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 10:47:17,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 10:47:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:17,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:17,191 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:17,191 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 10:47:17,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:17,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:17,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:17,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,246 INFO L182 omatonBuilderFactory]: Interpolants [470#true, 471#false, 472#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 473#(not (= 0 |ldv_malloc_#res.base|)), 474#(not (= 0 |entry_point_#t~ret10.base|)), 475#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:47:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:17,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:17,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:17,247 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 10:47:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:17,276 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 10:47:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:17,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:17,279 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:47:17,279 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:47:17,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:47:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 10:47:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:47:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 10:47:17,285 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 10:47:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 10:47:17,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 10:47:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:17,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:17,286 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:17,286 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 10:47:17,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:17,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:17,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:17,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,352 INFO L182 omatonBuilderFactory]: Interpolants [624#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 625#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 626#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 627#(= 1 (select |#valid| entry_point_~array~0.base)), 622#true, 623#false] [2018-02-02 10:47:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:17,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:17,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:17,353 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 10:47:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:17,422 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 10:47:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:17,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:17,423 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:47:17,423 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:47:17,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:47:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 10:47:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:47:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 10:47:17,428 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 10:47:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:17,429 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 10:47:17,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 10:47:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:17,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:17,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:17,430 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 10:47:17,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:17,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:17,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:47:17,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,636 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 775#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 776#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 777#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 778#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 779#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 780#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))] [2018-02-02 10:47:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:17,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:47:17,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:47:17,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:17,637 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 10:47:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:17,842 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:47:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:47:17,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:47:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:17,844 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:47:17,844 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:47:17,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:47:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 10:47:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:47:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 10:47:17,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 10:47:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:17,849 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 10:47:17,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:47:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 10:47:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:47:17,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:17,850 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:17,850 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 10:47:17,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:17,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:18,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:47:18,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,054 INFO L182 omatonBuilderFactory]: Interpolants [944#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 945#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 946#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 947#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 948#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 949#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 950#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 940#true, 941#false, 942#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 943#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)))] [2018-02-02 10:47:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:18,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:18,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:18,055 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 11 states. [2018-02-02 10:47:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,309 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-02-02 10:47:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:18,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:47:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,310 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:47:18,310 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:47:18,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:47:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-02 10:47:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:47:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-02 10:47:18,315 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 23 [2018-02-02 10:47:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,315 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-02 10:47:18,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-02 10:47:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:47:18,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,316 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,316 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 10:47:18,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:18,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:47:18,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,537 INFO L182 omatonBuilderFactory]: Interpolants [1123#true, 1124#false, 1125#(<= entry_point_~len~0 10), 1126#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1127#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 1128#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1129#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1130#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1131#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1132#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1133#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1134#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1135#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 10:47:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:18,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:18,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:18,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:18,537 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2018-02-02 10:47:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,885 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 10:47:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:18,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:47:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,886 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:47:18,887 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:47:18,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:47:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:47:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-02-02 10:47:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:47:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 10:47:18,890 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 27 [2018-02-02 10:47:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,890 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 10:47:18,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 10:47:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:18,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,891 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,895 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1824994908, now seen corresponding path program 1 times [2018-02-02 10:47:18,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:47:18,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:18,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:18,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:18,943 INFO L182 omatonBuilderFactory]: Interpolants [1299#true, 1300#false, 1301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1302#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1303#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:47:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:47:18,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:18,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:18,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:18,944 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 5 states. [2018-02-02 10:47:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,957 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 10:47:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:18,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:47:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,958 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:47:18,958 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:47:18,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:47:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 10:47:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:47:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 10:47:18,963 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 34 [2018-02-02 10:47:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,963 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 10:47:18,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 10:47:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:47:18,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,964 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,965 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452229, now seen corresponding path program 1 times [2018-02-02 10:47:18,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:19,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:19,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,009 INFO L182 omatonBuilderFactory]: Interpolants [1456#(= 1 (select |#valid| entry_point_~array~0.base)), 1457#(= |#valid| |old(#valid)|), 1458#(= 1 (select |#valid| |free_17_#in~array.base|)), 1459#(= 1 (select |#valid| free_17_~array.base)), 1454#true, 1455#false] [2018-02-02 10:47:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:19,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:19,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:19,010 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 6 states. [2018-02-02 10:47:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,109 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 10:47:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:19,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:47:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,110 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:47:19,110 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:47:19,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:47:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2018-02-02 10:47:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:47:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-02-02 10:47:19,117 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 35 [2018-02-02 10:47:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,117 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-02-02 10:47:19,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-02-02 10:47:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:47:19,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,119 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,119 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452230, now seen corresponding path program 1 times [2018-02-02 10:47:19,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:47:19,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,165 INFO L182 omatonBuilderFactory]: Interpolants [1681#true, 1682#false, 1683#(<= 10 entry_point_~len~0), 1684#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1685#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:47:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:19,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:19,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:19,166 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-02-02 10:47:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,218 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-02-02 10:47:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:19,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:47:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,219 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:47:19,219 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:47:19,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:47:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-02-02 10:47:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:47:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-02 10:47:19,224 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 35 [2018-02-02 10:47:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,225 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-02 10:47:19,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-02 10:47:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:47:19,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,226 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,227 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 2 times [2018-02-02 10:47:19,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:47:19,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,271 INFO L182 omatonBuilderFactory]: Interpolants [1894#true, 1895#false, 1896#(<= 10 entry_point_~len~0), 1897#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1898#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1899#(<= (+ entry_point_~i~2 8) entry_point_~len~0)] [2018-02-02 10:47:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:19,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:19,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:19,272 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-02-02 10:47:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,309 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-02 10:47:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:19,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 10:47:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,311 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:47:19,311 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:47:19,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:47:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 10:47:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:47:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 10:47:19,315 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-02 10:47:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,315 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 10:47:19,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 10:47:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:47:19,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,316 INFO L351 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, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,317 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 3 times [2018-02-02 10:47:19,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:47:19,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,360 INFO L182 omatonBuilderFactory]: Interpolants [2118#true, 2119#false, 2120#(<= 10 entry_point_~len~0), 2121#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2122#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2123#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2124#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 10:47:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:19,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:19,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:19,361 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 7 states. [2018-02-02 10:47:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,399 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-02-02 10:47:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:19,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 10:47:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,401 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:47:19,401 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:47:19,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:47:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 10:47:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:47:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 10:47:19,403 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 43 [2018-02-02 10:47:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,404 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 10:47:19,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 10:47:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:47:19,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,404 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,404 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 4 times [2018-02-02 10:47:19,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:47:19,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,447 INFO L182 omatonBuilderFactory]: Interpolants [2353#true, 2354#false, 2355#(<= 10 entry_point_~len~0), 2356#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2357#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2358#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2359#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2360#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:47:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:47:19,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:47:19,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:19,448 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 8 states. [2018-02-02 10:47:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,528 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 10:47:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:19,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 10:47:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,529 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:47:19,529 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:47:19,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:47:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:47:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 10:47:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:47:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 10:47:19,533 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-02 10:47:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,533 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 10:47:19,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:47:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 10:47:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:47:19,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,536 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,536 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 5 times [2018-02-02 10:47:19,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:47:19,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,610 INFO L182 omatonBuilderFactory]: Interpolants [2599#true, 2600#false, 2601#(<= 10 entry_point_~len~0), 2602#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2603#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2604#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2605#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2606#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2607#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 10:47:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:47:19,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:47:19,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:19,611 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-02 10:47:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,705 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-02-02 10:47:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:47:19,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 10:47:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,707 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:47:19,707 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:47:19,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:47:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:47:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:47:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-02-02 10:47:19,711 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 51 [2018-02-02 10:47:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,712 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-02-02 10:47:19,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:47:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-02-02 10:47:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:47:19,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,713 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,713 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1255609671, now seen corresponding path program 6 times [2018-02-02 10:47:19,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:47:19,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,774 INFO L182 omatonBuilderFactory]: Interpolants [2864#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2865#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2856#true, 2857#false, 2858#(<= 10 entry_point_~len~0), 2859#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2860#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2861#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2862#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2863#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:47:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:19,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:19,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:19,775 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 10 states. [2018-02-02 10:47:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,863 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-02 10:47:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:19,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:47:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,864 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:47:19,864 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:47:19,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:47:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:47:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 10:47:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:47:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 10:47:19,868 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 55 [2018-02-02 10:47:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,869 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 10:47:19,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 10:47:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:47:19,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,870 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,870 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash -241564528, now seen corresponding path program 7 times [2018-02-02 10:47:19,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:47:19,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,972 INFO L182 omatonBuilderFactory]: Interpolants [3124#true, 3125#false, 3126#(<= 10 entry_point_~len~0), 3127#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3128#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3129#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3130#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3131#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3132#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3133#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3134#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 10:47:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:19,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:19,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:19,973 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 11 states. [2018-02-02 10:47:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,076 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-02-02 10:47:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:20,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 10:47:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,077 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:47:20,077 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:47:20,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:47:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 10:47:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:47:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-02-02 10:47:20,082 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 59 [2018-02-02 10:47:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,082 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-02-02 10:47:20,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-02-02 10:47:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:47:20,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,085 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,085 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash -106145049, now seen corresponding path program 8 times [2018-02-02 10:47:20,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:47:20,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,181 INFO L182 omatonBuilderFactory]: Interpolants [3408#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3409#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3410#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3411#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3412#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3413#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3414#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3403#true, 3404#false, 3405#(<= 10 entry_point_~len~0), 3406#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3407#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:47:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:47:20,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:47:20,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:47:20,182 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 12 states. [2018-02-02 10:47:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,301 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2018-02-02 10:47:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:47:20,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:47:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,304 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:47:20,304 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:47:20,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:47:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:47:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 10:47:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:47:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2018-02-02 10:47:20,309 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 63 [2018-02-02 10:47:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,309 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2018-02-02 10:47:20,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:47:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-02-02 10:47:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:47:20,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,310 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,310 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1768795582, now seen corresponding path program 9 times [2018-02-02 10:47:20,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:47:20,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,421 INFO L182 omatonBuilderFactory]: Interpolants [3693#true, 3694#false, 3695#(<= 10 entry_point_~len~0), 3696#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3697#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3698#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3699#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3700#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3701#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3702#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3703#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3704#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3705#(<= (+ entry_point_~i~2 1) entry_point_~len~0)] [2018-02-02 10:47:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:20,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:20,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:20,422 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 13 states. [2018-02-02 10:47:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,544 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-02-02 10:47:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:47:20,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 10:47:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,545 INFO L225 Difference]: With dead ends: 134 [2018-02-02 10:47:20,545 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:47:20,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:47:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:47:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 10:47:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:47:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 10:47:20,548 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 67 [2018-02-02 10:47:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,549 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 10:47:20,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 10:47:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:47:20,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,549 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,549 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1609843435, now seen corresponding path program 10 times [2018-02-02 10:47:20,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:47:20,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:20,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:20,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,617 INFO L182 omatonBuilderFactory]: Interpolants [3992#true, 3993#false, 3994#(<= 10 entry_point_~len~0), 3995#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3996#(<= |alloc_17_#in~len| 0)] [2018-02-02 10:47:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:47:20,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:20,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:20,618 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-02-02 10:47:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,645 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-02-02 10:47:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:20,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 10:47:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,646 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:47:20,646 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:47:20,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:47:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2018-02-02 10:47:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:47:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-02-02 10:47:20,649 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 71 [2018-02-02 10:47:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,649 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-02-02 10:47:20,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-02-02 10:47:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:47:20,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,650 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,650 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:47:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863145, now seen corresponding path program 1 times [2018-02-02 10:47:20,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,687 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:47:20,690 INFO L168 Benchmark]: Toolchain (without parser) took 4573.05 ms. Allocated memory was 400.6 MB in the beginning and 677.4 MB in the end (delta: 276.8 MB). Free memory was 357.4 MB in the beginning and 429.1 MB in the end (delta: -71.8 MB). Peak memory consumption was 205.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:20,691 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:20,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.84 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:20,691 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:20,692 INFO L168 Benchmark]: RCFGBuilder took 264.13 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 319.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:20,692 INFO L168 Benchmark]: TraceAbstraction took 4115.21 ms. Allocated memory was 400.6 MB in the beginning and 677.4 MB in the end (delta: 276.8 MB). Free memory was 318.0 MB in the beginning and 429.1 MB in the end (delta: -111.2 MB). Peak memory consumption was 165.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:20,693 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.18 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.84 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.13 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 319.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4115.21 ms. Allocated memory was 400.6 MB in the beginning and 677.4 MB in the end (delta: 276.8 MB). Free memory was 318.0 MB in the beginning and 429.1 MB in the end (delta: -111.2 MB). Peak memory consumption was 165.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-20-700.csv Received shutdown request...