java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:31:52,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:31:52,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:31:52,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:31:52,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:31:52,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:31:52,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:31:52,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:31:52,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:31:52,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:31:52,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:31:52,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:31:52,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:31:52,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:31:52,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:31:52,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:31:52,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:31:52,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:31:52,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:31:52,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:31:52,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:31:52,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:31:52,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:31:52,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:31:52,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:31:52,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:31:52,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:31:52,986 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:31:52,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:31:52,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:31:52,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:31:52,987 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:31:52,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:31:52,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:31:52,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:31:52,998 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:31:52,998 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:31:52,999 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:31:52,999 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:31:52,999 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:31:53,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:31:53,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:31:53,000 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:31:53,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:31:53,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:31:53,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:31:53,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:31:53,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:31:53,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:31:53,002 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:31:53,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:31:53,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:31:53,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:31:53,003 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:31:53,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:31:53,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:31:53,004 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:31:53,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:31:53,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:31:53,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:31:53,004 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:31:53,005 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:31:53,005 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:31:53,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:31:53,053 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:31:53,057 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:31:53,059 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:31:53,059 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:31:53,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:31:53,232 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:31:53,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:31:53,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:31:53,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:31:53,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:31:53,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fee6ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53, skipping insertion in model container [2018-01-24 17:31:53,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,261 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:31:53,300 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:31:53,419 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:31:53,435 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:31:53,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53 WrapperNode [2018-01-24 17:31:53,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:31:53,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:31:53,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:31:53,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:31:53,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... [2018-01-24 17:31:53,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:31:53,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:31:53,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:31:53,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:31:53,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:31:53,532 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:31:53,533 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:31:53,533 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 17:31:53,533 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:31:53,533 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:31:53,533 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:31:53,533 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:31:53,533 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:31:53,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:31:53,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:31:53,832 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:31:53,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:31:53 BoogieIcfgContainer [2018-01-24 17:31:53,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:31:53,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:31:53,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:31:53,836 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:31:53,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:31:53" (1/3) ... [2018-01-24 17:31:53,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c9fb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:31:53, skipping insertion in model container [2018-01-24 17:31:53,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:53" (2/3) ... [2018-01-24 17:31:53,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c9fb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:31:53, skipping insertion in model container [2018-01-24 17:31:53,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:31:53" (3/3) ... [2018-01-24 17:31:53,840 INFO L105 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:31:53,847 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:31:53,854 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-24 17:31:53,892 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:31:53,892 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:31:53,892 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:31:53,892 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:31:53,892 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:31:53,892 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:31:53,893 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:31:53,893 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:31:53,893 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:31:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-24 17:31:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 17:31:53,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:53,916 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:53,917 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1577909781, now seen corresponding path program 1 times [2018-01-24 17:31:53,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:53,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:53,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:53,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:53,985 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:54,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:54,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:54,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:31:54,062 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:54,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 17:31:54,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 17:31:54,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:31:54,077 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-24 17:31:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:54,102 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-01-24 17:31:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 17:31:54,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 17:31:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:54,197 INFO L225 Difference]: With dead ends: 131 [2018-01-24 17:31:54,197 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 17:31:54,201 INFO L525 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-01-24 17:31:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 17:31:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 17:31:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 17:31:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-24 17:31:54,232 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 12 [2018-01-24 17:31:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:54,233 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-24 17:31:54,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 17:31:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-24 17:31:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:31:54,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:54,233 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:54,233 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671355, now seen corresponding path program 1 times [2018-01-24 17:31:54,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:54,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:54,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:54,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:54,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:54,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:31:54,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:54,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:31:54,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:31:54,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:31:54,324 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-01-24 17:31:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:54,499 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-24 17:31:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:31:54,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 17:31:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:54,502 INFO L225 Difference]: With dead ends: 93 [2018-01-24 17:31:54,502 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 17:31:54,503 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-24 17:31:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 17:31:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-01-24 17:31:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 17:31:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-01-24 17:31:54,512 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 13 [2018-01-24 17:31:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:54,513 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-01-24 17:31:54,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:31:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-01-24 17:31:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:31:54,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:54,514 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:54,514 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671356, now seen corresponding path program 1 times [2018-01-24 17:31:54,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:54,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:54,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:54,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:54,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:54,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:31:54,610 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:54,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:31:54,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:31:54,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:31:54,611 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2018-01-24 17:31:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:54,868 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-01-24 17:31:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:31:54,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 17:31:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:54,870 INFO L225 Difference]: With dead ends: 114 [2018-01-24 17:31:54,870 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 17:31:54,870 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-24 17:31:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 17:31:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-01-24 17:31:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 17:31:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-24 17:31:54,881 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 13 [2018-01-24 17:31:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:54,881 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-24 17:31:54,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:31:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-24 17:31:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:31:54,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:54,883 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:54,883 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598724, now seen corresponding path program 1 times [2018-01-24 17:31:54,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:54,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:54,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:54,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:54,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:54,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:54,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:31:54,992 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:54,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:31:54,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:31:54,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:31:54,993 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-01-24 17:31:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:55,313 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2018-01-24 17:31:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:31:55,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 17:31:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:55,315 INFO L225 Difference]: With dead ends: 192 [2018-01-24 17:31:55,315 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 17:31:55,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:31:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 17:31:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 97. [2018-01-24 17:31:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 17:31:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-01-24 17:31:55,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 23 [2018-01-24 17:31:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:55,328 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-01-24 17:31:55,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:31:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-01-24 17:31:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:31:55,329 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:55,330 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:55,330 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598725, now seen corresponding path program 1 times [2018-01-24 17:31:55,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:55,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:55,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:55,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:55,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:55,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:55,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:55,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:31:55,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:55,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:31:55,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:31:55,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:31:55,479 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2018-01-24 17:31:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:55,822 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2018-01-24 17:31:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:31:55,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 17:31:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:55,824 INFO L225 Difference]: With dead ends: 193 [2018-01-24 17:31:55,824 INFO L226 Difference]: Without dead ends: 186 [2018-01-24 17:31:55,824 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:31:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-24 17:31:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-01-24 17:31:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 17:31:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-24 17:31:55,835 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2018-01-24 17:31:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:55,835 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-24 17:31:55,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:31:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-24 17:31:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:31:55,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:55,837 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:55,837 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 919312261, now seen corresponding path program 1 times [2018-01-24 17:31:55,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:55,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:55,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:55,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:55,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:55,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:55,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:55,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:31:55,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:55,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:31:55,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:31:55,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:31:55,894 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-24 17:31:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:56,002 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-01-24 17:31:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:31:56,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 17:31:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:56,003 INFO L225 Difference]: With dead ends: 160 [2018-01-24 17:31:56,004 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:31:56,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:31:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:31:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2018-01-24 17:31:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 17:31:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-01-24 17:31:56,014 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-01-24 17:31:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:56,014 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-01-24 17:31:56,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:31:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-01-24 17:31:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:31:56,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:56,016 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:56,016 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256062, now seen corresponding path program 1 times [2018-01-24 17:31:56,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:56,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:56,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,018 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:56,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:56,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:56,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:31:56,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:56,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:31:56,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:31:56,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:31:56,098 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 7 states. [2018-01-24 17:31:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:56,261 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-24 17:31:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:31:56,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-24 17:31:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:56,262 INFO L225 Difference]: With dead ends: 127 [2018-01-24 17:31:56,262 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 17:31:56,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:31:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 17:31:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2018-01-24 17:31:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 17:31:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-01-24 17:31:56,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 26 [2018-01-24 17:31:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:56,271 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-01-24 17:31:56,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:31:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-01-24 17:31:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:31:56,272 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:56,272 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:56,272 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256063, now seen corresponding path program 1 times [2018-01-24 17:31:56,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:56,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:56,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:56,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:31:56,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:31:56,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:31:56,418 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:31:56,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:31:56,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:31:56,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:31:56,419 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-01-24 17:31:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:31:56,600 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-01-24 17:31:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:31:56,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-24 17:31:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:31:56,601 INFO L225 Difference]: With dead ends: 124 [2018-01-24 17:31:56,601 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 17:31:56,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:31:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 17:31:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-01-24 17:31:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 17:31:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-24 17:31:56,607 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 26 [2018-01-24 17:31:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:31:56,607 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-24 17:31:56,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:31:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-24 17:31:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:31:56,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:56,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:56,608 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 17:31:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1313779944, now seen corresponding path program 1 times [2018-01-24 17:31:56,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:56,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:56,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:56,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:31:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:31:56,657 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 17:31:56,673 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 17:31:56,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:31:56 BoogieIcfgContainer [2018-01-24 17:31:56,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:31:56,691 INFO L168 Benchmark]: Toolchain (without parser) took 3457.47 ms. Allocated memory was 306.2 MB in the beginning and 501.7 MB in the end (delta: 195.6 MB). Free memory was 265.2 MB in the beginning and 422.7 MB in the end (delta: -157.4 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:31:56,692 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:31:56,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.17 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 253.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:31:56,692 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 306.2 MB. Free memory is still 253.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:31:56,693 INFO L168 Benchmark]: RCFGBuilder took 349.22 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 228.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:31:56,693 INFO L168 Benchmark]: TraceAbstraction took 2855.56 ms. Allocated memory was 306.2 MB in the beginning and 501.7 MB in the end (delta: 195.6 MB). Free memory was 228.7 MB in the beginning and 422.7 MB in the end (delta: -194.0 MB). Peak memory consumption was 1.5 MB. Max. memory is 5.3 GB. [2018-01-24 17:31:56,694 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.21 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.17 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 253.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 306.2 MB. Free memory is still 253.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 349.22 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 228.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2855.56 ms. Allocated memory was 306.2 MB in the beginning and 501.7 MB in the end (delta: 195.6 MB). Free memory was 228.7 MB in the beginning and 422.7 MB in the end (delta: -194.0 MB). Peak memory consumption was 1.5 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: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L647] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 25 error locations. UNSAFE Result, 2.8s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 984 SDslu, 997 SDs, 0 SdLazy, 1156 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 337 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 11512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-31-56-700.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-31-56-700.csv Received shutdown request...