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/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:42:11,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:42:11,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:42:11,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:42:11,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:42:11,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:42:11,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:42:11,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:42:11,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:42:11,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:42:11,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:42:11,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:42:11,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:42:11,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:42:11,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:42:11,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:42:11,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:42:11,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:42:11,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:42:11,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:42:11,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:42:11,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:42:11,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:42:11,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:42:11,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:42:11,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:42:11,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:42:11,056 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:42:11,056 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:42:11,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:42:11,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:42:11,057 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:42:11,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:42:11,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:42:11,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:42:11,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:42:11,067 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:42:11,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:42:11,068 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:42:11,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:42:11,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:42:11,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:42:11,070 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:42:11,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:42:11,105 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:42:11,107 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:42:11,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:42:11,109 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:42:11,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-02 10:42:11,187 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:42:11,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:42:11,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:42:11,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:42:11,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:42:11,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfbbfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11, skipping insertion in model container [2018-02-02 10:42:11,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,206 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:42:11,219 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:42:11,319 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:42:11,334 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:42:11,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11 WrapperNode [2018-02-02 10:42:11,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:42:11,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:42:11,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:42:11,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:42:11,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (1/1) ... [2018-02-02 10:42:11,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:42:11,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:42:11,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:42:11,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:42:11,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (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:42:11,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:42:11,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:42:11,409 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-02-02 10:42:11,409 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:42:11,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:42:11,410 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:42:11,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:42:11,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:42:11,582 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:42:11,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:11 BoogieIcfgContainer [2018-02-02 10:42:11,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:42:11,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:42:11,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:42:11,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:42:11,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:42:11" (1/3) ... [2018-02-02 10:42:11,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7472ddb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:11, skipping insertion in model container [2018-02-02 10:42:11,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:11" (2/3) ... [2018-02-02 10:42:11,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7472ddb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:11, skipping insertion in model container [2018-02-02 10:42:11,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:11" (3/3) ... [2018-02-02 10:42:11,587 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-02 10:42:11,594 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:42:11,598 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 10:42:11,624 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:42:11,624 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:42:11,625 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:42:11,625 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:42:11,625 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:42:11,625 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:42:11,625 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:42:11,625 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:42:11,626 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:42:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-02-02 10:42:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:42:11,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:11,647 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:11,647 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-02-02 10:42:11,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:11,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:11,746 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:42:11,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:11,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:42:11,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:11,751 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:42:11,751 INFO L182 omatonBuilderFactory]: Interpolants [71#true, 72#false] [2018-02-02 10:42:11,751 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:42:11,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:42:11,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:42:11,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:42:11,767 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-02-02 10:42:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:11,787 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 10:42:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:42:11,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 10:42:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:11,797 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:42:11,797 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:42:11,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:42:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:42:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 10:42:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 10:42:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-02 10:42:11,829 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-02-02 10:42:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:11,829 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-02 10:42:11,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:42:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-02 10:42:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:42:11,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:11,830 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:11,830 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:11,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-02-02 10:42:11,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:11,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:11,936 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:42:11,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:11,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:42:11,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:11,937 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:42:11,937 INFO L182 omatonBuilderFactory]: Interpolants [208#(= main_~i~2 0), 206#true, 207#false] [2018-02-02 10:42:11,937 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:42:11,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:42:11,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:42:11,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:42:11,939 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-02-02 10:42:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:11,983 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-02 10:42:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:42:11,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-02 10:42:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:11,986 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:42:11,986 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:42:11,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:42:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:42:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-02-02 10:42:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:42:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 10:42:11,996 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-02-02 10:42:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:11,997 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 10:42:11,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:42:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 10:42:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:42:11,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:11,998 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:42:11,998 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:11,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-02-02 10:42:11,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:12,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:12,090 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:42:12,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:12,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:42:12,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:12,091 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:42:12,091 INFO L182 omatonBuilderFactory]: Interpolants [344#true, 345#false, 346#(= 0 main_~i~2), 347#(= 0 |foo_#in~size|), 348#(= foo_~size 0), 349#(and (= foo_~size 0) (= foo_~i~1 0))] [2018-02-02 10:42:12,091 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:42:12,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:42:12,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:42:12,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:42:12,092 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-02 10:42:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:12,187 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 10:42:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:42:12,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 10:42:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:12,189 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:42:12,189 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:42:12,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:42:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-02-02 10:42:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:42:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-02 10:42:12,194 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-02-02 10:42:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:12,194 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-02 10:42:12,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:42:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-02 10:42:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:42:12,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:12,195 INFO L351 BasicCegarLoop]: trace histogram [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:42:12,195 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-02-02 10:42:12,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:12,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:12,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:12,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:42:12,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:12,240 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:42:12,240 INFO L182 omatonBuilderFactory]: Interpolants [518#true, 519#false, 520#(= 1 (select |#valid| |foo_~#a~0.base|)), 521#(= 1 (select |#valid| |bar_#in~b.base|)), 522#(= 1 (select |#valid| bar_~b.base))] [2018-02-02 10:42:12,240 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:42:12,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:42:12,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:42:12,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:12,240 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-02 10:42:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:12,291 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-02 10:42:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:42:12,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 10:42:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:12,294 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:42:12,294 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:42:12,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:42:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:42:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 10:42:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:42:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:42:12,299 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-02-02 10:42:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:12,299 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:42:12,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:42:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:42:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:42:12,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:12,300 INFO L351 BasicCegarLoop]: trace histogram [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:42:12,300 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-02-02 10:42:12,302 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:12,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:12,366 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:42:12,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:12,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:42:12,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:12,367 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:42:12,367 INFO L182 omatonBuilderFactory]: Interpolants [679#true, 680#false, 681#(= 0 main_~i~2), 682#(= 0 |foo_#in~size|), 683#(= 0 foo_~size), 684#(= 0 |bar_#in~size|), 685#(and (= bar_~size 0) (= bar_~i~0 0))] [2018-02-02 10:42:12,368 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:42:12,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:42:12,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:42:12,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:42:12,368 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-02-02 10:42:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:12,455 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-02 10:42:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:42:12,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:42:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:12,457 INFO L225 Difference]: With dead ends: 89 [2018-02-02 10:42:12,457 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 10:42:12,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:42:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 10:42:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-02-02 10:42:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:42:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 10:42:12,463 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-02-02 10:42:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:12,463 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 10:42:12,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:42:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 10:42:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:42:12,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:12,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:12,464 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-02-02 10:42:12,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:12,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:12,504 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:42:12,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:12,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:42:12,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:12,505 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:42:12,505 INFO L182 omatonBuilderFactory]: Interpolants [864#(= 0 bar_~res~0), 865#(= 0 |bar_#res|), 866#(= |foo_#t~ret5| 0), 862#true, 863#false] [2018-02-02 10:42:12,505 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:42:12,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:42:12,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:42:12,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:12,506 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-02-02 10:42:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:12,520 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 10:42:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:42:12,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 10:42:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:12,521 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:42:12,521 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:42:12,522 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:42:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:42:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-02 10:42:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:42:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-02 10:42:12,527 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-02-02 10:42:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:12,528 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-02 10:42:12,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:42:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-02 10:42:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:42:12,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:12,529 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:12,529 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 10:42:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-02-02 10:42:12,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:12,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:12,548 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:42:12,552 INFO L168 Benchmark]: Toolchain (without parser) took 1364.76 ms. Allocated memory was 404.8 MB in the beginning and 619.2 MB in the end (delta: 214.4 MB). Free memory was 360.1 MB in the beginning and 506.1 MB in the end (delta: -146.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:12,553 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:42:12,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.33 ms. Allocated memory is still 404.8 MB. Free memory was 360.1 MB in the beginning and 352.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:12,553 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 404.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:12,553 INFO L168 Benchmark]: RCFGBuilder took 211.34 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 328.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:12,554 INFO L168 Benchmark]: TraceAbstraction took 968.67 ms. Allocated memory was 404.8 MB in the beginning and 619.2 MB in the end (delta: 214.4 MB). Free memory was 328.0 MB in the beginning and 506.1 MB in the end (delta: -178.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:12,555 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.33 ms. Allocated memory is still 404.8 MB. Free memory was 360.1 MB in the beginning and 352.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 404.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 211.34 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 328.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 968.67 ms. Allocated memory was 404.8 MB in the beginning and 619.2 MB in the end (delta: 214.4 MB). Free memory was 328.0 MB in the beginning and 506.1 MB in the end (delta: -178.1 MB). Peak memory consumption was 36.3 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/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-42-12-561.csv Received shutdown request...