java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:53:34,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:53:34,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:53:34,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:53:34,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:53:34,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:53:34,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:53:34,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:53:34,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:53:34,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:53:34,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:53:34,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:53:34,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:53:34,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:53:34,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:53:34,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:53:34,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:53:34,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:53:34,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:53:34,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:53:34,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:53:34,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:53:34,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:53:34,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:53:34,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:53:34,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:53:34,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:53:34,823 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:53:34,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:53:34,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:53:34,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:53:34,824 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:53:34,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:53:34,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:53:34,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:53:34,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:53:34,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:53:34,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:53:34,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:53:34,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:53:34,835 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:53:34,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:53:34,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:53:34,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:53:34,870 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:53:34,872 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:53:34,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:53:34,874 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:53:34,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-04 13:53:35,014 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:53:35,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:53:35,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:53:35,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:53:35,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:53:35,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35, skipping insertion in model container [2018-02-04 13:53:35,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,033 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:53:35,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:53:35,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:53:35,165 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:53:35,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35 WrapperNode [2018-02-04 13:53:35,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:53:35,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:53:35,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:53:35,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:53:35,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (1/1) ... [2018-02-04 13:53:35,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:53:35,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:53:35,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:53:35,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:53:35,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (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-04 13:53:35,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:53:35,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:53:35,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:53:35,231 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:53:35,231 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:53:35,232 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:53:35,233 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:53:35,233 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:53:35,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:53:35,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:53:35,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:53:35,374 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:53:35,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:35 BoogieIcfgContainer [2018-02-04 13:53:35,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:53:35,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:53:35,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:53:35,376 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:53:35,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:53:35" (1/3) ... [2018-02-04 13:53:35,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb1052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:35, skipping insertion in model container [2018-02-04 13:53:35,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:35" (2/3) ... [2018-02-04 13:53:35,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb1052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:35, skipping insertion in model container [2018-02-04 13:53:35,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:35" (3/3) ... [2018-02-04 13:53:35,378 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-04 13:53:35,383 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:53:35,388 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 13:53:35,420 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:53:35,420 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:53:35,420 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:53:35,420 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:53:35,420 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:53:35,420 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:53:35,420 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:53:35,421 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:53:35,421 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:53:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-02-04 13:53:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:53:35,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:35,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:53:35,440 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-02-04 13:53:35,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:35,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:35,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:35,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:35,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:35,587 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-04 13:53:35,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:35,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:53:35,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:53:35,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:53:35,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:53:35,602 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-02-04 13:53:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:35,722 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-04 13:53:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:53:35,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 13:53:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:35,729 INFO L225 Difference]: With dead ends: 68 [2018-02-04 13:53:35,729 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 13:53:35,730 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-04 13:53:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 13:53:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-02-04 13:53:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:53:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-02-04 13:53:35,758 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-02-04 13:53:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:35,758 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-02-04 13:53:35,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:53:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-02-04 13:53:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:53:35,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:35,760 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-04 13:53:35,760 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-02-04 13:53:35,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:35,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:35,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:35,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:35,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:35,816 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-04 13:53:35,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:35,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:53:35,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:53:35,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:53:35,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:53:35,818 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-02-04 13:53:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:35,864 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-02-04 13:53:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:53:35,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:53:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:35,866 INFO L225 Difference]: With dead ends: 76 [2018-02-04 13:53:35,866 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 13:53:35,866 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-04 13:53:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 13:53:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-02-04 13:53:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:53:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 13:53:35,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-02-04 13:53:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:35,873 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 13:53:35,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:53:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 13:53:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:53:35,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:35,874 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] [2018-02-04 13:53:35,875 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-02-04 13:53:35,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:35,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:35,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:35,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:35,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:35,932 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-04 13:53:35,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:35,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:53:35,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:53:35,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:53:35,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:53:35,933 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-02-04 13:53:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:35,944 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 13:53:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:53:35,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 13:53:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:35,945 INFO L225 Difference]: With dead ends: 44 [2018-02-04 13:53:35,945 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 13:53:35,946 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-04 13:53:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 13:53:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 13:53:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 13:53:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 13:53:35,948 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-04 13:53:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:35,948 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 13:53:35,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:53:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 13:53:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:53:35,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:35,949 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] [2018-02-04 13:53:35,949 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-02-04 13:53:35,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:35,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:35,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:35,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:35,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:35,996 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-04 13:53:35,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:35,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:53:35,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:53:35,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:53:35,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:53:35,997 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-02-04 13:53:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:36,074 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 13:53:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:53:36,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 13:53:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:36,076 INFO L225 Difference]: With dead ends: 49 [2018-02-04 13:53:36,076 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 13:53:36,076 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-04 13:53:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 13:53:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-04 13:53:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 13:53:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 13:53:36,080 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-02-04 13:53:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:36,080 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 13:53:36,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:53:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 13:53:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:53:36,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:36,081 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] [2018-02-04 13:53:36,081 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-02-04 13:53:36,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:36,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:36,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:36,126 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-04 13:53:36,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:36,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:53:36,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:53:36,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:53:36,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:53:36,127 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-02-04 13:53:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:36,143 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-02-04 13:53:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:53:36,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 13:53:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:36,144 INFO L225 Difference]: With dead ends: 68 [2018-02-04 13:53:36,144 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 13:53:36,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:53:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 13:53:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-02-04 13:53:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:53:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 13:53:36,147 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-02-04 13:53:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:36,147 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 13:53:36,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:53:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 13:53:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:53:36,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:36,148 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, 1, 1, 1] [2018-02-04 13:53:36,148 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-02-04 13:53:36,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:36,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:36,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:53:36,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:53:36,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:53:36,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:53:36,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:53:36,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:53:36,192 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-02-04 13:53:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:36,205 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-02-04 13:53:36,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:53:36,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 13:53:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:36,206 INFO L225 Difference]: With dead ends: 62 [2018-02-04 13:53:36,206 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 13:53:36,206 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-04 13:53:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 13:53:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-02-04 13:53:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 13:53:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 13:53:36,210 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-02-04 13:53:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:36,210 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 13:53:36,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:53:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 13:53:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:53:36,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:36,211 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:53:36,211 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-02-04 13:53:36,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:36,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:36,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:53:36,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:53:36,322 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:53:36,330 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:53:36,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:53:36,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:36,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:53:36,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:53:36,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:36,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:36,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 13:53:36,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:36,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:53:36,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 13:53:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:53:36,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:53:36,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 13:53:36,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:53:36,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:53:36,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:53:36,478 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-04 13:53:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:53:36,641 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 13:53:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:53:36,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 13:53:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:53:36,649 INFO L225 Difference]: With dead ends: 73 [2018-02-04 13:53:36,649 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 13:53:36,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:53:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 13:53:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2018-02-04 13:53:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:53:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 13:53:36,653 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 13:53:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:53:36,654 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 13:53:36,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:53:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 13:53:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:53:36,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:53:36,655 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:53:36,655 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:53:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-02-04 13:53:36,655 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:53:36,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:53:36,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:53:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:53:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:53:36,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:53:36,924 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:53:36,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:53:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:53:36,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:53:36,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:53:36,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:36,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 13:53:36,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:36,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 13:53:36,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 13:53:37,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:53:37,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:53:37,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:37,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:37,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-02-04 13:53:37,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:37,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:37,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-02-04 13:53:37,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:53:37,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 13:53:37,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 13:53:37,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:53:37,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 13:53:37,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 13:53:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:53:37,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:53:37,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-04 13:53:37,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:53:37,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:53:37,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-04 13:53:37,503 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 19 states. [2018-02-04 13:54:18,898 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-02-04 13:54:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:19,011 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-02-04 13:54:19,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:54:19,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-02-04 13:54:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:19,012 INFO L225 Difference]: With dead ends: 95 [2018-02-04 13:54:19,012 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 13:54:19,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=122, Invalid=686, Unknown=4, NotChecked=0, Total=812 [2018-02-04 13:54:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 13:54:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-02-04 13:54:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 13:54:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-04 13:54:19,018 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 28 [2018-02-04 13:54:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:19,018 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-04 13:54:19,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:54:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-04 13:54:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:54:19,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:19,019 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, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:19,019 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 652258778, now seen corresponding path program 1 times [2018-02-04 13:54:19,019 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:19,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:19,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:19,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:19,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:54:19,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:54:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:54:19,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:54:19,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:54:19,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:54:19,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:54:19,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:54:19,049 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 4 states. [2018-02-04 13:54:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:54:19,067 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-02-04 13:54:19,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:54:19,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:54:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:54:19,072 INFO L225 Difference]: With dead ends: 60 [2018-02-04 13:54:19,072 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:54:19,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:54:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:54:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 13:54:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 13:54:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-02-04 13:54:19,076 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 29 [2018-02-04 13:54:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:54:19,076 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-02-04 13:54:19,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:54:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-02-04 13:54:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:54:19,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:54:19,077 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:54:19,077 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 13:54:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash -244587327, now seen corresponding path program 1 times [2018-02-04 13:54:19,077 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:54:19,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:54:19,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:19,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:54:19,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:54:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:54:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:54:19,108 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 13:54:19,116 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 13:54:19,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:54:19 BoogieIcfgContainer [2018-02-04 13:54:19,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:54:19,129 INFO L168 Benchmark]: Toolchain (without parser) took 44114.10 ms. Allocated memory was 401.6 MB in the beginning and 659.0 MB in the end (delta: 257.4 MB). Free memory was 358.5 MB in the beginning and 545.3 MB in the end (delta: -186.8 MB). Peak memory consumption was 70.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:54:19,130 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:54:19,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.19 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 345.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:54:19,130 INFO L168 Benchmark]: Boogie Preprocessor took 23.28 ms. Allocated memory is still 401.6 MB. Free memory was 345.3 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:54:19,131 INFO L168 Benchmark]: RCFGBuilder took 175.24 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 325.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:54:19,131 INFO L168 Benchmark]: TraceAbstraction took 43753.82 ms. Allocated memory was 401.6 MB in the beginning and 659.0 MB in the end (delta: 257.4 MB). Free memory was 325.9 MB in the beginning and 545.3 MB in the end (delta: -219.4 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. [2018-02-04 13:54:19,132 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.11 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.19 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 345.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.28 ms. Allocated memory is still 401.6 MB. Free memory was 345.3 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.24 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 325.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43753.82 ms. Allocated memory was 401.6 MB in the beginning and 659.0 MB in the end (delta: 257.4 MB). Free memory was 325.9 MB in the beginning and 545.3 MB in the end (delta: -219.4 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1458]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1459] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; [L1443] int j; VAL [array={42:0}, i=0, len=10] [L1444] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1445] COND TRUE i=0) VAL [array={42:0}, i=0, j=-1, len=10, p={0:0}] [L1459] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. UNSAFE Result, 43.7s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 42.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 386 SDtfs, 423 SDslu, 1116 SDs, 0 SdLazy, 686 SolverSat, 74 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 136 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 256 ConstructedInterpolants, 17 QuantifiedInterpolants, 44123 SizeOfPredicates, 8 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 17/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-54-19-138.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-54-19-138.csv Received shutdown request...