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_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:52:41,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:52:41,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:52:41,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:52:41,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:52:41,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:52:41,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:52:41,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:52:41,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:52:41,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:52:41,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:52:41,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:52:41,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:52:41,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:52:41,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:52:41,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:52:41,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:52:41,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:52:41,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:52:41,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:52:41,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:52:41,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:52:41,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:52:41,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:52:41,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:52:41,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:52:41,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:52:41,402 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:52:41,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:52:41,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:52:41,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:52:41,404 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_preciseopt.epf [2018-01-25 02:52:41,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:52:41,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:52:41,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:52:41,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:52:41,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:52:41,415 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:52:41,415 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:52:41,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:52:41,416 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:52:41,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:52:41,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:52:41,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:52:41,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:52:41,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:52:41,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:52:41,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:52:41,418 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:52:41,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:52:41,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:52:41,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:52:41,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:52:41,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:52:41,420 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:52:41,421 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:52:41,421 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:52:41,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:52:41,467 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:52:41,470 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:52:41,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:52:41,472 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:52:41,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-25 02:52:41,690 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:52:41,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:52:41,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:52:41,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:52:41,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:52:41,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:52:41" (1/1) ... [2018-01-25 02:52:41,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214b3e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:41, skipping insertion in model container [2018-01-25 02:52:41,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:52:41" (1/1) ... [2018-01-25 02:52:41,742 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:52:41,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:52:42,036 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:52:42,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:52:42,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42 WrapperNode [2018-01-25 02:52:42,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:52:42,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:52:42,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:52:42,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:52:42,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (1/1) ... [2018-01-25 02:52:42,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:52:42,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:52:42,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:52:42,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:52:42,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (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-25 02:52:42,229 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:52:42,229 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:52:42,229 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 02:52:42,229 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:52:42,229 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:52:42,230 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:52:42,231 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 02:52:42,231 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:52:42,231 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:52:42,231 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:52:42,551 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:52:42,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:52:42 BoogieIcfgContainer [2018-01-25 02:52:42,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:52:42,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:52:42,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:52:42,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:52:42,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:52:41" (1/3) ... [2018-01-25 02:52:42,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e85ad7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:52:42, skipping insertion in model container [2018-01-25 02:52:42,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:52:42" (2/3) ... [2018-01-25 02:52:42,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e85ad7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:52:42, skipping insertion in model container [2018-01-25 02:52:42,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:52:42" (3/3) ... [2018-01-25 02:52:42,558 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-01-25 02:52:42,567 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:52:42,574 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 02:52:42,667 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:52:42,668 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:52:42,668 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:52:42,668 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:52:42,668 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:52:42,668 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:52:42,668 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:52:42,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:52:42,669 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:52:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-25 02:52:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:52:42,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:52:42,721 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:52:42,721 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:52:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-01-25 02:52:42,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:52:42,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:42,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:52:42,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:42,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:52:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:52:42,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:52:43,032 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-25 02:52:43,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:52:43,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:52:43,035 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:52:43,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:52:43,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:52:43,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:52:43,055 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-25 02:52:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:52:43,413 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-25 02:52:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:52:43,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 02:52:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:52:43,430 INFO L225 Difference]: With dead ends: 84 [2018-01-25 02:52:43,430 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:52:43,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:52:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:52:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:52:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:52:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-25 02:52:43,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-01-25 02:52:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:52:43,471 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-25 02:52:43,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:52:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-25 02:52:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:52:43,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:52:43,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:52:43,472 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:52:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-01-25 02:52:43,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:52:43,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:43,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:52:43,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:43,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:52:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:52:43,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:52:43,640 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-25 02:52:43,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:52:43,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:52:43,641 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:52:43,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:52:43,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:52:43,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:52:43,644 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-01-25 02:52:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:52:43,805 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-25 02:52:43,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:52:43,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 02:52:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:52:43,807 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:52:43,807 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:52:43,808 INFO L525 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-25 02:52:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:52:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:52:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:52:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 02:52:43,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-01-25 02:52:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:52:43,816 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 02:52:43,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:52:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 02:52:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:52:43,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:52:43,817 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:52:43,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-25 02:52:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-01-25 02:52:43,818 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:52:43,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:43,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:52:43,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:43,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:52:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:52:43,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:52:43,953 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-25 02:52:43,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:52:43,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:52:43,954 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:52:43,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:52:43,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:52:43,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:52:43,955 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-01-25 02:52:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:52:44,160 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-25 02:52:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:52:44,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-25 02:52:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:52:44,162 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:52:44,162 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:52:44,163 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-25 02:52:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:52:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 02:52:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 02:52:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-25 02:52:44,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-01-25 02:52:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:52:44,171 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-25 02:52:44,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:52:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-25 02:52:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:52:44,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:52:44,172 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:52:44,172 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:52:44,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-01-25 02:52:44,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:52:44,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:44,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:52:44,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:44,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:52:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:52:44,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:52:44,444 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-25 02:52:44,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:52:44,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:52:44,449 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:52:44,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:52:44,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:52:44,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:52:44,450 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-01-25 02:52:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:52:44,778 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-25 02:52:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:52:44,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-25 02:52:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:52:44,779 INFO L225 Difference]: With dead ends: 80 [2018-01-25 02:52:44,780 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:52:44,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:52:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:52:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-01-25 02:52:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:52:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 02:52:44,788 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-01-25 02:52:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:52:44,788 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 02:52:44,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:52:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 02:52:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:52:44,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:52:44,789 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:52:44,789 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:52:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-01-25 02:52:44,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:52:44,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:44,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:52:44,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:52:44,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:52:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:52:44,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:52:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:52:45,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:52:45,057 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:52:45,059 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 02:52:45,062 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [43], [44], [45], [46], [47], [50], [76], [77], [78], [80] [2018-01-25 02:52:45,115 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:52:45,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:53:29,418 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:53:29,430 INFO L268 AbstractInterpreter]: Visited 19 different actions 28 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 02:53:29,470 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:53:29,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:29,471 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 02:53:29,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:29,516 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:53:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:29,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:29,613 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-25 02:53:29,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:29,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:29,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-25 02:53:29,735 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-25 02:53:29,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:29,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:53:29,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-25 02:53:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:30,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:31,830 WARN L143 SmtUtils]: Spent 327ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-25 02:53:31,835 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 02:53:31,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 5 [2018-01-25 02:53:31,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:31,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:31,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:31,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-25 02:53:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:31,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:31,904 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:53:31,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:31,933 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:53:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:31,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:31,999 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-25 02:53:32,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:53:32,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 02:53:32,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:32,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:53:32,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:32,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:32,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:53:32,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 02:53:32,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 02:53:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:32,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:32,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:53:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 02:53:32,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 02:53:32,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:32,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 02:53:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:32,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:53:32,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 7, 7] total 24 [2018-01-25 02:53:32,476 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:53:32,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:53:32,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:53:32,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=476, Unknown=2, NotChecked=0, Total=600 [2018-01-25 02:53:32,477 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-01-25 02:53:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:32,891 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-25 02:53:32,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:53:32,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-01-25 02:53:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:32,902 INFO L225 Difference]: With dead ends: 90 [2018-01-25 02:53:32,902 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 02:53:32,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=162, Invalid=592, Unknown=2, NotChecked=0, Total=756 [2018-01-25 02:53:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 02:53:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-01-25 02:53:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 02:53:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 02:53:32,917 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-01-25 02:53:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:32,917 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 02:53:32,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:53:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 02:53:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:53:32,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:32,919 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:32,919 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-01-25 02:53:32,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:32,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:32,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:32,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:32,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:33,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:33,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:33,230 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:53:33,230 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:53:33,230 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:53:33,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:33,230 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:53:33,238 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:53:33,238 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:53:33,257 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:53:33,262 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:53:33,265 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:53:33,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:33,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:53:33,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:33,279 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-25 02:53:33,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:33,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:33,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 02:53:33,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:33,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:33,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:53:33,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:33,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:53:33,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:33,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:53:33,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-01-25 02:53:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:33,752 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:34,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:53:34,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 02:53:34,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 02:53:34,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 02:53:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:34,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:34,350 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:53:34,358 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:53:34,358 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:53:34,387 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:53:34,423 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:53:34,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:53:34,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:34,448 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-25 02:53:34,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:53:34,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 02:53:34,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:34,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:53:34,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:34,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:34,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:53:34,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 02:53:34,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 02:53:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:34,771 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:34,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:53:34,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 02:53:34,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 02:53:34,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:34,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 02:53:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:34,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:53:34,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 8, 8] total 23 [2018-01-25 02:53:34,903 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:53:34,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:53:34,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:53:34,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-01-25 02:53:34,904 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-01-25 02:53:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:35,463 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 02:53:35,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:53:35,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-25 02:53:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:35,465 INFO L225 Difference]: With dead ends: 104 [2018-01-25 02:53:35,465 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 02:53:35,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-01-25 02:53:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 02:53:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-01-25 02:53:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 02:53:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-25 02:53:35,476 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-01-25 02:53:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:35,476 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-25 02:53:35,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:53:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-25 02:53:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:53:35,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:35,477 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:35,478 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-01-25 02:53:35,478 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:35,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:35,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:53:35,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:35,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:35,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:35,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:35,729 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:53:35,729 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:53:35,729 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:53:35,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:35,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:53:35,735 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:53:35,735 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:53:35,746 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:53:35,750 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:53:35,751 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:53:35,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:35,757 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-25 02:53:35,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:53:35,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 02:53:35,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:35,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:35,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:53:35,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:53:35,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:35,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-25 02:53:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 02:53:35,954 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 02:53:36,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:36,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:53:36,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:53:36,185 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:53:36,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:53:36,233 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:53:36,246 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:53:36,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:36,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:53:36,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:36,262 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-25 02:53:36,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:36,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:53:36,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 02:53:36,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:36,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:53:36,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:53:36,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:36,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:53:36,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:53:36,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:53:36,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 02:53:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 02:53:36,570 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:53:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 02:53:36,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:53:36,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7, 7, 7] total 29 [2018-01-25 02:53:36,791 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:53:36,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 02:53:36,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 02:53:36,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-01-25 02:53:36,792 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-01-25 02:53:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:37,720 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-25 02:53:37,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:53:37,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-25 02:53:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:37,724 INFO L225 Difference]: With dead ends: 125 [2018-01-25 02:53:37,724 INFO L226 Difference]: Without dead ends: 90 [2018-01-25 02:53:37,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 02:53:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-25 02:53:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-25 02:53:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:53:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 02:53:37,736 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-01-25 02:53:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:37,737 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 02:53:37,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 02:53:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 02:53:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 02:53:37,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:37,738 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:37,739 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-01-25 02:53:37,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:37,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:37,740 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:53:37,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:37,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:37,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:37,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:37,915 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:53:37,915 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-25 02:53:37,916 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [29], [32], [42], [43], [44], [45], [46], [47], [50], [76], [77], [78], [80] [2018-01-25 02:53:37,917 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:53:37,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:53:38,997 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:53:38,998 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:53:38,998 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:53:38,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:38,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:53:39,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:39,008 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:53:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:39,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:53:39,045 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:53:39,046 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:53:39,051 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:53:39,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:53:39 BoogieIcfgContainer [2018-01-25 02:53:39,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:53:39,052 INFO L168 Benchmark]: Toolchain (without parser) took 57361.49 ms. Allocated memory was 301.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 260.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 189.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:53:39,053 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 301.5 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:53:39,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.42 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:53:39,054 INFO L168 Benchmark]: Boogie Preprocessor took 53.34 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:53:39,054 INFO L168 Benchmark]: RCFGBuilder took 402.37 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 229.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:53:39,054 INFO L168 Benchmark]: TraceAbstraction took 56499.19 ms. Allocated memory was 301.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 229.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 158.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:53:39,056 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.15 ms. Allocated memory is still 301.5 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 394.42 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.34 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 402.37 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 229.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56499.19 ms. Allocated memory was 301.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 229.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 158.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 263 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 65 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 26 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.346575 RENAME_VARIABLES(MILLISECONDS) : 0.855462 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.597739 PROJECTAWAY(MILLISECONDS) : 0.097175 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.051686 DISJOIN(MILLISECONDS) : 0.404644 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.896764 ADD_EQUALITY(MILLISECONDS) : 0.038644 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013660 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 88 #UNFREEZE : 0 #CONJOIN : 107 #PROJECTAWAY : 72 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 83 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 56.3s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 1084 SDslu, 649 SDs, 0 SdLazy, 985 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 244 SyntacticMatches, 13 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 281 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 412 ConstructedInterpolants, 141 QuantifiedInterpolants, 159048 SizeOfPredicates, 42 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 56/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-53-39-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-53-39-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-53-39-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-53-39-066.csv Completed graceful shutdown