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/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:18:46,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:18:46,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:18:46,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:18:46,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:18:46,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:18:46,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:18:46,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:18:46,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:18:46,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:18:46,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:18:46,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:18:46,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:18:46,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:18:46,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:18:46,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:18:46,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:18:46,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:18:46,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:18:46,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:18:46,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:18:46,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:18:46,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:18:46,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:18:46,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:18:46,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:18:46,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:18:46,702 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:18:46,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:18:46,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:18:46,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:18:46,703 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 14:18:46,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:18:46,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:18:46,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:18:46,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:18:46,714 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:18:46,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:18:46,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:18:46,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:18:46,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:18:46,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:18:46,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:18:46,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:18:46,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:18:46,716 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:18:46,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:18:46,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:18:46,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:18:46,750 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:18:46,753 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:18:46,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:18:46,754 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:18:46,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-02-04 14:18:46,882 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:18:46,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:18:46,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:18:46,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:18:46,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:18:46,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:18:46" (1/1) ... [2018-02-04 14:18:46,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:46, skipping insertion in model container [2018-02-04 14:18:46,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:18:46" (1/1) ... [2018-02-04 14:18:46,900 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:18:46,928 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:18:47,016 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:18:47,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:18:47,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47 WrapperNode [2018-02-04 14:18:47,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:18:47,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:18:47,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:18:47,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:18:47,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (1/1) ... [2018-02-04 14:18:47,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:18:47,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:18:47,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:18:47,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:18:47,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (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 14:18:47,104 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:18:47,104 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:18:47,104 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 14:18:47,104 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:18:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:18:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:18:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 14:18:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:18:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:18:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:18:47,228 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:18:47,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:18:47 BoogieIcfgContainer [2018-02-04 14:18:47,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:18:47,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:18:47,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:18:47,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:18:47,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:18:46" (1/3) ... [2018-02-04 14:18:47,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec7e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:18:47, skipping insertion in model container [2018-02-04 14:18:47,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:18:47" (2/3) ... [2018-02-04 14:18:47,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec7e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:18:47, skipping insertion in model container [2018-02-04 14:18:47,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:18:47" (3/3) ... [2018-02-04 14:18:47,234 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-02-04 14:18:47,239 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:18:47,243 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 14:18:47,273 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:18:47,274 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:18:47,274 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:18:47,274 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:18:47,274 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:18:47,274 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:18:47,274 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:18:47,274 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:18:47,275 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:18:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-02-04 14:18:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 14:18:47,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,296 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,296 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times [2018-02-04 14:18:47,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,404 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 14:18:47,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:18:47,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 14:18:47,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 14:18:47,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 14:18:47,422 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-02-04 14:18:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,437 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-02-04 14:18:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 14:18:47,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 14:18:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,445 INFO L225 Difference]: With dead ends: 38 [2018-02-04 14:18:47,446 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 14:18:47,447 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-04 14:18:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 14:18:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 14:18:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:18:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 14:18:47,521 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9 [2018-02-04 14:18:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,522 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 14:18:47,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 14:18:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 14:18:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 14:18:47,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,523 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,523 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times [2018-02-04 14:18:47,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,557 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 14:18:47,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:18:47,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:18:47,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:18:47,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:18:47,560 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2018-02-04 14:18:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,585 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-04 14:18:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:18:47,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 14:18:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,586 INFO L225 Difference]: With dead ends: 46 [2018-02-04 14:18:47,586 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 14:18:47,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:18:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 14:18:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-04 14:18:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 14:18:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-02-04 14:18:47,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12 [2018-02-04 14:18:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,590 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-02-04 14:18:47,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:18:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-02-04 14:18:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 14:18:47,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,590 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,591 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times [2018-02-04 14:18:47,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,629 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 14:18:47,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:18:47,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:18:47,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:18:47,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:18:47,631 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2018-02-04 14:18:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,665 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-02-04 14:18:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:18:47,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 14:18:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,667 INFO L225 Difference]: With dead ends: 46 [2018-02-04 14:18:47,667 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 14:18:47,667 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-04 14:18:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 14:18:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-02-04 14:18:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 14:18:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-02-04 14:18:47,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2018-02-04 14:18:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,671 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-02-04 14:18:47,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:18:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-02-04 14:18:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:18:47,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,672 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,672 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times [2018-02-04 14:18:47,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,723 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 14:18:47,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:18:47,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:18:47,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:18:47,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:18:47,725 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-02-04 14:18:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,774 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-04 14:18:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:18:47,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 14:18:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,776 INFO L225 Difference]: With dead ends: 34 [2018-02-04 14:18:47,776 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 14:18:47,776 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 14:18:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 14:18:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-02-04 14:18:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 14:18:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-02-04 14:18:47,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13 [2018-02-04 14:18:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,779 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-02-04 14:18:47,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:18:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-02-04 14:18:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:18:47,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,780 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,780 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times [2018-02-04 14:18:47,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,840 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 14:18:47,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:18:47,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:18:47,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:18:47,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:18:47,842 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-02-04 14:18:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,880 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-02-04 14:18:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:18:47,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 14:18:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,881 INFO L225 Difference]: With dead ends: 32 [2018-02-04 14:18:47,881 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 14:18:47,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 14:18:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 14:18:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-02-04 14:18:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 14:18:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 14:18:47,885 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13 [2018-02-04 14:18:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,885 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 14:18:47,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:18:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 14:18:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 14:18:47,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,886 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,886 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times [2018-02-04 14:18:47,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:18:47,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:47,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:18:47,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:18:47,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:18:47,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:18:47,916 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-02-04 14:18:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:47,967 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-02-04 14:18:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:18:47,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 14:18:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:47,969 INFO L225 Difference]: With dead ends: 46 [2018-02-04 14:18:47,969 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 14:18:47,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:18:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 14:18:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-02-04 14:18:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 14:18:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-02-04 14:18:47,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2018-02-04 14:18:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:47,973 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-02-04 14:18:47,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:18:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-02-04 14:18:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 14:18:47,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:47,974 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:47,974 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times [2018-02-04 14:18:47,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:47,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:47,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:47,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:47,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:18:48,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:48,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:18:48,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:18:48,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:18:48,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:18:48,011 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-02-04 14:18:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:48,057 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 14:18:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:18:48,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 14:18:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:48,058 INFO L225 Difference]: With dead ends: 39 [2018-02-04 14:18:48,058 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 14:18:48,059 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 14:18:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 14:18:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-02-04 14:18:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 14:18:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 14:18:48,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-02-04 14:18:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:48,061 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 14:18:48,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:18:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 14:18:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 14:18:48,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:48,062 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:48,062 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times [2018-02-04 14:18:48,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:48,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:48,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:48,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:48,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:48,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:18:48,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:48,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:18:48,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:18:48,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:18:48,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:18:48,131 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2018-02-04 14:18:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:48,178 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-02-04 14:18:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:18:48,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 14:18:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:48,178 INFO L225 Difference]: With dead ends: 41 [2018-02-04 14:18:48,178 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 14:18:48,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:18:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 14:18:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-02-04 14:18:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 14:18:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-02-04 14:18:48,181 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2018-02-04 14:18:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:48,181 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-02-04 14:18:48,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:18:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-02-04 14:18:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 14:18:48,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:48,182 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:48,182 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 14:18:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times [2018-02-04 14:18:48,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:48,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:48,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:48,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:48,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 14:18:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 14:18:48,209 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 14:18:48,216 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 14:18:48,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:18:48 BoogieIcfgContainer [2018-02-04 14:18:48,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:18:48,225 INFO L168 Benchmark]: Toolchain (without parser) took 1342.47 ms. Allocated memory was 402.7 MB in the beginning and 613.9 MB in the end (delta: 211.3 MB). Free memory was 360.8 MB in the beginning and 482.0 MB in the end (delta: -121.1 MB). Peak memory consumption was 90.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:48,226 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:18:48,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.59 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 348.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:48,226 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 402.7 MB. Free memory was 348.9 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:48,226 INFO L168 Benchmark]: RCFGBuilder took 164.83 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 330.8 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:48,226 INFO L168 Benchmark]: TraceAbstraction took 994.99 ms. Allocated memory was 402.7 MB in the beginning and 613.9 MB in the end (delta: 211.3 MB). Free memory was 329.5 MB in the beginning and 482.0 MB in the end (delta: -152.5 MB). Peak memory consumption was 58.8 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:48,227 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 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.59 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 348.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 402.7 MB. Free memory was 348.9 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.83 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 330.8 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 994.99 ms. Allocated memory was 402.7 MB in the beginning and 613.9 MB in the end (delta: 211.3 MB). Free memory was 329.5 MB in the beginning and 482.0 MB in the end (delta: -152.5 MB). Peak memory consumption was 58.8 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: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L634] p = t VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1, t={13:0}] [L637] COND FALSE !(p->h != 1) [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, t={13:0}] [L640] p = p->n [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. UNSAFE Result, 0.9s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 262 SDslu, 144 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, 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, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 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/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-18-48-231.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-18-48-231.csv Received shutdown request...