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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:04:45,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:04:45,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:04:45,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:04:45,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:04:45,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:04:45,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:04:45,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:04:45,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:04:45,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:04:45,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:04:45,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:04:45,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:04:45,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:04:45,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:04:45,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:04:45,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:04:45,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:04:45,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:04:45,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:04:45,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:04:45,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:04:45,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:04:45,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:04:45,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:04:45,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:04:45,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:04:45,320 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:04:45,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:04:45,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:04:45,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:04:45,322 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:04:45,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:04:45,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:04:45,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:04:45,334 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:04:45,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:04:45,335 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:04:45,335 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:04:45,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:04:45,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:04:45,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:04:45,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:04:45,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:04:45,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:04:45,337 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:04:45,337 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:04:45,337 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:04:45,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:04:45,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:04:45,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:04:45,338 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:04:45,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:04:45,339 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:04:45,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:04:45,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:04:45,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:04:45,339 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:04:45,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:04:45,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:04:45,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:04:45,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:04:45,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:04:45,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:04:45,342 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:04:45,342 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:04:45,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:04:45,402 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:04:45,406 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:04:45,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:04:45,411 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:04:45,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-01-31 09:04:45,622 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:04:45,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:04:45,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:45,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:04:45,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:04:45,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45, skipping insertion in model container [2018-01-31 09:04:45,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:45,727 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:45,857 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:45,880 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:45,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45 WrapperNode [2018-01-31 09:04:45,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:45,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:04:45,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:04:45,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:04:45,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (1/1) ... [2018-01-31 09:04:45,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:04:45,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:04:45,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:04:45,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:04:45,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (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-31 09:04:46,026 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:04:46,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:04:46,027 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:04:46,027 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:04:46,028 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:04:46,028 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:04:46,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:04:46,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:04:46,028 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:04:46,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:04:46,580 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:04:46,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:46 BoogieIcfgContainer [2018-01-31 09:04:46,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:04:46,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:04:46,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:04:46,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:04:46,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:04:45" (1/3) ... [2018-01-31 09:04:46,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233acb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:46, skipping insertion in model container [2018-01-31 09:04:46,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:45" (2/3) ... [2018-01-31 09:04:46,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233acb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:46, skipping insertion in model container [2018-01-31 09:04:46,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:46" (3/3) ... [2018-01-31 09:04:46,594 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-31 09:04:46,605 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:04:46,613 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 09:04:46,651 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:04:46,652 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:04:46,652 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:04:46,652 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:04:46,652 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:04:46,652 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:04:46,652 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:04:46,653 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:04:46,653 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:04:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-01-31 09:04:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:04:46,674 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:46,674 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:46,675 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -407048758, now seen corresponding path program 1 times [2018-01-31 09:04:46,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:46,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:46,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:46,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:46,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:46,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:46,869 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-31 09:04:46,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:46,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:04:46,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:04:46,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:04:46,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:04:46,892 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2018-01-31 09:04:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:46,927 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-31 09:04:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:04:46,929 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-31 09:04:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:46,940 INFO L225 Difference]: With dead ends: 130 [2018-01-31 09:04:46,940 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:04:46,949 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-01-31 09:04:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:04:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 09:04:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:04:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-31 09:04:47,121 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 18 [2018-01-31 09:04:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:47,122 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-31 09:04:47,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:04:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-31 09:04:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:04:47,123 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:47,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:47,123 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1533652828, now seen corresponding path program 1 times [2018-01-31 09:04:47,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:47,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:47,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:47,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:47,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:47,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:47,350 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-31 09:04:47,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:47,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:04:47,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:04:47,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:04:47,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:47,353 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2018-01-31 09:04:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:47,803 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-31 09:04:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:04:47,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-31 09:04:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:47,805 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:04:47,806 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:04:47,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:04:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:04:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 09:04:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:04:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-31 09:04:47,815 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 21 [2018-01-31 09:04:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:47,815 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-31 09:04:47,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:04:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-31 09:04:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:04:47,816 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:47,816 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:47,817 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1533652827, now seen corresponding path program 1 times [2018-01-31 09:04:47,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:47,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:47,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:47,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:47,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:47,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:48,023 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-31 09:04:48,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:48,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:04:48,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:04:48,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:04:48,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:04:48,025 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2018-01-31 09:04:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:48,520 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-01-31 09:04:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:04:48,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-31 09:04:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:48,525 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:04:48,525 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:04:48,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:04:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:04:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 79. [2018-01-31 09:04:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 09:04:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-31 09:04:48,536 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 21 [2018-01-31 09:04:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:48,536 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-31 09:04:48,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:04:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-31 09:04:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:48,537 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:48,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:48,537 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -260541751, now seen corresponding path program 1 times [2018-01-31 09:04:48,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:48,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:48,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:48,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:48,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:48,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:48,827 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-31 09:04:48,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:48,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:04:48,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:04:48,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:04:48,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:04:48,829 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 4 states. [2018-01-31 09:04:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:48,896 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-31 09:04:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:04:48,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-31 09:04:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:48,897 INFO L225 Difference]: With dead ends: 79 [2018-01-31 09:04:48,898 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:04:48,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:04:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:04:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:04:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-31 09:04:48,907 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 28 [2018-01-31 09:04:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:48,907 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-31 09:04:48,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:04:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-31 09:04:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:48,909 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:48,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:48,909 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -260541750, now seen corresponding path program 1 times [2018-01-31 09:04:48,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:48,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:48,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:48,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:48,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:48,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:49,150 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-31 09:04:49,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:49,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:04:49,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:04:49,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:04:49,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:04:49,151 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-01-31 09:04:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:49,497 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-01-31 09:04:49,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:04:49,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-31 09:04:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:49,503 INFO L225 Difference]: With dead ends: 158 [2018-01-31 09:04:49,503 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 09:04:49,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:04:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 09:04:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2018-01-31 09:04:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:04:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-01-31 09:04:49,517 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 28 [2018-01-31 09:04:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:49,518 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-01-31 09:04:49,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:04:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-01-31 09:04:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:04:49,519 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:49,519 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:49,519 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2034907374, now seen corresponding path program 1 times [2018-01-31 09:04:49,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:49,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:49,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:49,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:49,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:49,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:49,672 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-31 09:04:49,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:49,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:04:49,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:04:49,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:04:49,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:04:49,674 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2018-01-31 09:04:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:50,043 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-01-31 09:04:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:50,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-31 09:04:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:50,045 INFO L225 Difference]: With dead ends: 119 [2018-01-31 09:04:50,045 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 09:04:50,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:04:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 09:04:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2018-01-31 09:04:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 09:04:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-01-31 09:04:50,057 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 28 [2018-01-31 09:04:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:50,057 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-01-31 09:04:50,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:04:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-01-31 09:04:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:04:50,059 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:50,059 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:50,059 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1244682560, now seen corresponding path program 1 times [2018-01-31 09:04:50,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:50,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:50,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:50,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:50,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:50,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:50,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:04:50,145 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:04:50,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:50,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:04:50,283 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-31 09:04:50,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:04:50,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-01-31 09:04:50,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:50,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:50,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:50,304 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 9 states. [2018-01-31 09:04:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:50,515 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-01-31 09:04:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:04:50,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-31 09:04:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:50,518 INFO L225 Difference]: With dead ends: 144 [2018-01-31 09:04:50,518 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 09:04:50,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:04:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 09:04:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-01-31 09:04:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 09:04:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 09:04:50,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 34 [2018-01-31 09:04:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:50,529 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 09:04:50,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 09:04:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:04:50,531 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:50,531 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:50,531 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1404742047, now seen corresponding path program 1 times [2018-01-31 09:04:50,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:50,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:50,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:50,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:50,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:50,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:50,969 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-31 09:04:50,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:50,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:04:50,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:50,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:50,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:50,971 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 9 states. [2018-01-31 09:04:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:51,180 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-01-31 09:04:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:51,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-31 09:04:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:51,181 INFO L225 Difference]: With dead ends: 149 [2018-01-31 09:04:51,181 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:04:51,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:04:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:04:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2018-01-31 09:04:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-31 09:04:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-01-31 09:04:51,197 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 35 [2018-01-31 09:04:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:51,197 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-01-31 09:04:51,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-01-31 09:04:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 09:04:51,199 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:51,199 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:51,199 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -985011355, now seen corresponding path program 1 times [2018-01-31 09:04:51,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:51,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:51,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:51,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:51,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:51,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:04:51,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:51,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:04:51,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:04:51,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:04:51,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:51,507 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 9 states. [2018-01-31 09:04:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:51,883 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-01-31 09:04:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:04:51,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-31 09:04:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:51,885 INFO L225 Difference]: With dead ends: 111 [2018-01-31 09:04:51,885 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 09:04:51,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:04:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 09:04:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-01-31 09:04:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 09:04:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-31 09:04:51,894 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 39 [2018-01-31 09:04:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:51,895 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-31 09:04:51,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:04:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-31 09:04:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:04:51,896 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:51,896 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:51,897 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1024246505, now seen corresponding path program 1 times [2018-01-31 09:04:51,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:51,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:51,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:51,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:51,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:51,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:52,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:04:52,103 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:04:52,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:52,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:04:52,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 09:04:52,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:04:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:04:52,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 09:04:52,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-31 09:04:52,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:04:52,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:04:52,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-31 09:04:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:52,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:04:52,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-01-31 09:04:52,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:04:52,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:04:52,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:04:52,510 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 15 states. [2018-01-31 09:04:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:53,314 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-01-31 09:04:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:04:53,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-31 09:04:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:53,316 INFO L225 Difference]: With dead ends: 145 [2018-01-31 09:04:53,316 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 09:04:53,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:04:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 09:04:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2018-01-31 09:04:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:04:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-01-31 09:04:53,328 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 41 [2018-01-31 09:04:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:53,328 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-01-31 09:04:53,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:04:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-01-31 09:04:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:04:53,330 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:53,330 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:53,330 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:04:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash -302211608, now seen corresponding path program 1 times [2018-01-31 09:04:53,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:53,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:53,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:53,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:53,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:04:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:04:53,387 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:04:53,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:04:53 BoogieIcfgContainer [2018-01-31 09:04:53,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:04:53,453 INFO L168 Benchmark]: Toolchain (without parser) took 7830.67 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 268.5 MB in the beginning and 451.7 MB in the end (delta: -183.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. [2018-01-31 09:04:53,455 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:04:53,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.31 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 257.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:04:53,455 INFO L168 Benchmark]: Boogie Preprocessor took 62.27 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:04:53,455 INFO L168 Benchmark]: RCFGBuilder took 627.14 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 234.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:04:53,456 INFO L168 Benchmark]: TraceAbstraction took 6869.99 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 234.6 MB in the beginning and 451.7 MB in the end (delta: -217.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:04:53,459 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.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.31 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 257.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 62.27 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 627.14 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 234.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6869.99 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 234.6 MB in the beginning and 451.7 MB in the end (delta: -217.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: IVAL [\old(a)=13, \old(a)=10, \old(b)=9, \old(b)=8, \old(n)=11, a={10:13}, b={8:9}, n=11] [L619] int *a, *b; VAL [\old(a)=13, \old(a)=10, \old(b)=9, \old(b)=8, \old(n)=11, a={0:0}, b={0:0}, n=11] [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, __VERIFIER_nondet_int()=0, a={0:0}, b={0:0}, n=1] [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L637] b = malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, b++={5:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, b++={5:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, n=1] [L624] int i; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, n=1] [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=0, n=1] [L626] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L640] FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L640] COND FALSE !(b[-1]) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] [L643] FCALL free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={5:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={5:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 17 error locations. UNSAFE Result, 6.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 902 SDslu, 1801 SDs, 0 SdLazy, 1226 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=5, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 157 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 356 ConstructedInterpolants, 17 QuantifiedInterpolants, 66363 SizeOfPredicates, 12 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 18/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-04-53-471.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-04-53-471.csv Received shutdown request...