java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:53:23,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:53:23,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:53:23,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:53:23,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:53:23,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:53:23,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:53:23,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:53:23,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:53:23,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:53:23,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:53:23,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:53:23,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:53:23,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:53:23,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:53:23,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:53:23,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:53:23,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:53:23,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:53:23,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:53:23,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:53:23,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:53:23,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:53:23,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:53:23,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:53:23,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:53:23,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:53:23,327 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:53:23,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:53:23,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:53:23,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:53:23,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:53:23,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:53:23,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:53:23,340 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:53:23,340 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:53:23,340 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:53:23,340 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:53:23,340 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:53:23,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:53:23,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:53:23,341 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:53:23,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:53:23,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:53:23,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:53:23,342 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:53:23,342 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:53:23,343 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:53:23,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:53:23,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:53:23,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:53:23,343 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:53:23,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:53:23,344 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:53:23,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:53:23,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:53:23,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:53:23,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:53:23,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:53:23,347 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:53:23,347 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:53:23,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:53:23,394 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:53:23,398 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:53:23,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:53:23,400 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:53:23,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-29 23:53:23,514 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:53:23,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:53:23,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:53:23,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:53:23,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:53:23,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d16f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23, skipping insertion in model container [2018-01-29 23:53:23,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,544 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:53:23,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:53:23,666 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:53:23,682 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:53:23,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23 WrapperNode [2018-01-29 23:53:23,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:53:23,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:53:23,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:53:23,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:53:23,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (1/1) ... [2018-01-29 23:53:23,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:53:23,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:53:23,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:53:23,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:53:23,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (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-29 23:53:23,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:53:23,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:53:23,771 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:53:23,771 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:53:23,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:53:23,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:53:23,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:53:23,963 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:53:23,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:53:23 BoogieIcfgContainer [2018-01-29 23:53:23,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:53:23,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:53:23,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:53:23,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:53:23,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:53:23" (1/3) ... [2018-01-29 23:53:23,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edf4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:53:23, skipping insertion in model container [2018-01-29 23:53:23,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:23" (2/3) ... [2018-01-29 23:53:23,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edf4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:53:23, skipping insertion in model container [2018-01-29 23:53:23,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:53:23" (3/3) ... [2018-01-29 23:53:23,969 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-29 23:53:23,976 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:53:23,982 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-29 23:53:24,026 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:53:24,026 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:53:24,027 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:53:24,027 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:53:24,027 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:53:24,027 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:53:24,027 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:53:24,027 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:53:24,028 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:53:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-29 23:53:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-29 23:53:24,051 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:24,052 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:24,052 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1440860085, now seen corresponding path program 1 times [2018-01-29 23:53:24,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:24,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:24,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:24,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:24,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:24,236 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-29 23:53:24,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:24,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:53:24,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:53:24,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:53:24,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:53:24,259 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-29 23:53:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:24,363 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-01-29 23:53:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:53:24,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-29 23:53:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:24,378 INFO L225 Difference]: With dead ends: 134 [2018-01-29 23:53:24,378 INFO L226 Difference]: Without dead ends: 79 [2018-01-29 23:53:24,382 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:53:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-29 23:53:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-01-29 23:53:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 23:53:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-29 23:53:24,501 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-01-29 23:53:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:24,501 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-29 23:53:24,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:53:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-29 23:53:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:53:24,502 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:24,502 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:24,502 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash -658382786, now seen corresponding path program 1 times [2018-01-29 23:53:24,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:24,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:24,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:24,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:24,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:24,619 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-29 23:53:24,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:24,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:53:24,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:53:24,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:53:24,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:53:24,622 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-01-29 23:53:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:24,746 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-01-29 23:53:24,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:53:24,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-29 23:53:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:24,748 INFO L225 Difference]: With dead ends: 126 [2018-01-29 23:53:24,748 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 23:53:24,750 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:53:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 23:53:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-01-29 23:53:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 23:53:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-29 23:53:24,757 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 23 [2018-01-29 23:53:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:24,757 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-29 23:53:24,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:53:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-29 23:53:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:53:24,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:24,758 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:24,758 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1064970165, now seen corresponding path program 1 times [2018-01-29 23:53:24,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:24,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:24,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:24,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:24,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:24,818 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-29 23:53:24,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:24,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:53:24,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:53:24,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:53:24,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:53:24,819 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2018-01-29 23:53:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:24,870 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-01-29 23:53:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:53:24,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-29 23:53:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:24,872 INFO L225 Difference]: With dead ends: 68 [2018-01-29 23:53:24,872 INFO L226 Difference]: Without dead ends: 67 [2018-01-29 23:53:24,872 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:53:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-29 23:53:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-29 23:53:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 23:53:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-01-29 23:53:24,878 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 24 [2018-01-29 23:53:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:24,878 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-01-29 23:53:24,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:53:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-01-29 23:53:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:53:24,879 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:24,879 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:24,879 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1064970166, now seen corresponding path program 1 times [2018-01-29 23:53:24,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:24,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:24,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:24,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:24,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:25,038 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-29 23:53:25,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:25,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:53:25,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:53:25,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:53:25,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:53:25,040 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-01-29 23:53:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:25,137 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-29 23:53:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:53:25,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-29 23:53:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:25,139 INFO L225 Difference]: With dead ends: 73 [2018-01-29 23:53:25,139 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 23:53:25,139 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:53:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 23:53:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-01-29 23:53:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 23:53:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-29 23:53:25,148 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 24 [2018-01-29 23:53:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:25,149 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-29 23:53:25,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:53:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-29 23:53:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:53:25,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:25,151 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:25,151 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1397858905, now seen corresponding path program 1 times [2018-01-29 23:53:25,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:25,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:25,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:25,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:25,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:25,210 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-29 23:53:25,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:25,211 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:25,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:25,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:25,260 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-29 23:53:25,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:25,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-29 23:53:25,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:53:25,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:53:25,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:53:25,281 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2018-01-29 23:53:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:25,348 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-29 23:53:25,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:53:25,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-29 23:53:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:25,352 INFO L225 Difference]: With dead ends: 86 [2018-01-29 23:53:25,353 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 23:53:25,353 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:53:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 23:53:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2018-01-29 23:53:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-29 23:53:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-29 23:53:25,363 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 32 [2018-01-29 23:53:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:25,364 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-29 23:53:25,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:53:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-29 23:53:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 23:53:25,365 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:25,366 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:25,366 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash -383953043, now seen corresponding path program 1 times [2018-01-29 23:53:25,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:25,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:25,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:25,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:25,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:25,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:25,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:25,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:25,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:25,616 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-29 23:53:25,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:25,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:25,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 23:53:25,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:53:25,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:53:25,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:53:25,701 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-29 23:53:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:25,869 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-29 23:53:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:53:25,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-29 23:53:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:25,870 INFO L225 Difference]: With dead ends: 85 [2018-01-29 23:53:25,870 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 23:53:25,871 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:53:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 23:53:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-01-29 23:53:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-29 23:53:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-29 23:53:25,879 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 33 [2018-01-29 23:53:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:25,879 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-29 23:53:25,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:53:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-29 23:53:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:53:25,881 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:25,881 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:25,881 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1868700066, now seen corresponding path program 2 times [2018-01-29 23:53:25,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:25,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:25,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:25,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:25,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:26,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:26,016 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 23:53:26,032 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:26,046 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:26,053 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:26,054 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:26,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:53:26,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:26,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-01-29 23:53:26,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:53:26,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:53:26,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:53:26,288 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 15 states. [2018-01-29 23:53:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:26,743 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-29 23:53:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:53:26,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-29 23:53:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:26,745 INFO L225 Difference]: With dead ends: 97 [2018-01-29 23:53:26,745 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 23:53:26,746 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:53:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 23:53:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-01-29 23:53:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-29 23:53:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-29 23:53:26,758 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 41 [2018-01-29 23:53:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:26,758 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-29 23:53:26,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:53:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-29 23:53:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:53:26,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:26,760 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:26,760 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2095127146, now seen corresponding path program 2 times [2018-01-29 23:53:26,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:26,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:26,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:26,762 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:26,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:26,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:26,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:26,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:26,978 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:26,987 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:26,991 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:26,992 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:26,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:27,000 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-29 23:53:27,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:27,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:27,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:27,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:27,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-29 23:53:27,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:53:27,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:53:27,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:53:27,061 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 10 states. [2018-01-29 23:53:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:27,247 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-01-29 23:53:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:53:27,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-29 23:53:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:27,248 INFO L225 Difference]: With dead ends: 96 [2018-01-29 23:53:27,248 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 23:53:27,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:53:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 23:53:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-01-29 23:53:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 23:53:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-29 23:53:27,255 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 42 [2018-01-29 23:53:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:27,255 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-29 23:53:27,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:53:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-29 23:53:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:53:27,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:27,257 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:27,257 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1104010386, now seen corresponding path program 1 times [2018-01-29 23:53:27,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:27,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:27,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:27,258 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:27,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:27,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:53:27,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:27,320 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 23:53:27,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:27,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:27,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:27,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2018-01-29 23:53:27,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:53:27,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:53:27,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:53:27,427 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 11 states. [2018-01-29 23:53:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:27,571 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-01-29 23:53:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:53:27,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-01-29 23:53:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:27,573 INFO L225 Difference]: With dead ends: 185 [2018-01-29 23:53:27,573 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 23:53:27,574 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 23:53:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-29 23:53:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 23:53:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-29 23:53:27,585 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 43 [2018-01-29 23:53:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:27,586 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-29 23:53:27,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:53:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-29 23:53:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:53:27,588 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:27,588 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:27,589 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1992308109, now seen corresponding path program 3 times [2018-01-29 23:53:27,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:27,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:27,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:27,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:27,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:27,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 23:53:27,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:27,886 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:27,895 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:53:27,905 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:27,918 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:27,930 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:27,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:27,946 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-29 23:53:27,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:27,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:27,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 23:53:28,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:28,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-01-29 23:53:28,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:53:28,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:53:28,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:53:28,181 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 18 states. [2018-01-29 23:53:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:28,478 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-29 23:53:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:53:28,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-01-29 23:53:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:28,480 INFO L225 Difference]: With dead ends: 95 [2018-01-29 23:53:28,480 INFO L226 Difference]: Without dead ends: 94 [2018-01-29 23:53:28,480 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:53:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-29 23:53:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2018-01-29 23:53:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 23:53:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-29 23:53:28,486 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2018-01-29 23:53:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:28,486 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-29 23:53:28,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:53:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-29 23:53:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 23:53:28,488 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:28,488 INFO L350 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:28,488 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2132771683, now seen corresponding path program 2 times [2018-01-29 23:53:28,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:28,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:28,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:28,489 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:28,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:28,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-29 23:53:28,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:28,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 23:53:28,712 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:28,722 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:28,733 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:28,735 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:28,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-29 23:53:28,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:28,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-29 23:53:28,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:53:28,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:53:28,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:28,824 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 16 states. [2018-01-29 23:53:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:29,084 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-01-29 23:53:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:53:29,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2018-01-29 23:53:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:29,086 INFO L225 Difference]: With dead ends: 169 [2018-01-29 23:53:29,086 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 23:53:29,087 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:53:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 23:53:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-01-29 23:53:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-29 23:53:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-01-29 23:53:29,096 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 90 [2018-01-29 23:53:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:29,096 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-01-29 23:53:29,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:53:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-01-29 23:53:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-29 23:53:29,098 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:29,098 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:29,099 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1578399211, now seen corresponding path program 3 times [2018-01-29 23:53:29,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:29,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:29,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,100 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:29,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:29,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:29,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:29,249 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:29,257 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:53:29,269 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:29,274 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:29,280 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:29,281 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:29,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:29,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:53:29,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-29 23:53:29,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:53:29,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:53:29,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:53:29,351 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 10 states. [2018-01-29 23:53:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:29,463 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-01-29 23:53:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:53:29,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-01-29 23:53:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:29,465 INFO L225 Difference]: With dead ends: 108 [2018-01-29 23:53:29,465 INFO L226 Difference]: Without dead ends: 107 [2018-01-29 23:53:29,465 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:53:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-29 23:53:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2018-01-29 23:53:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 23:53:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-29 23:53:29,471 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 108 [2018-01-29 23:53:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:29,471 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-29 23:53:29,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:53:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-29 23:53:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-29 23:53:29,473 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:29,473 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:29,473 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1646242832, now seen corresponding path program 1 times [2018-01-29 23:53:29,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:29,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:29,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,474 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:29,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:29,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:29,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:29,565 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:29,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:29,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 109 proven. 33 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-29 23:53:29,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:29,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-01-29 23:53:29,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:53:29,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:53:29,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:29,738 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 16 states. [2018-01-29 23:53:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:29,921 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2018-01-29 23:53:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:53:29,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 116 [2018-01-29 23:53:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:29,922 INFO L225 Difference]: With dead ends: 208 [2018-01-29 23:53:29,922 INFO L226 Difference]: Without dead ends: 130 [2018-01-29 23:53:29,922 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:53:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-29 23:53:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2018-01-29 23:53:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 23:53:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-29 23:53:29,931 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 116 [2018-01-29 23:53:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:29,931 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-29 23:53:29,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:53:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-29 23:53:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-29 23:53:29,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:29,934 INFO L350 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:29,934 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 273739284, now seen corresponding path program 2 times [2018-01-29 23:53:29,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:29,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:29,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:29,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:29,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-01-29 23:53:30,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:30,078 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:30,084 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:30,095 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:30,096 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:30,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:30,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:30,120 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 12 treesize of output 5 [2018-01-29 23:53:30,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:30,121 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-29 23:53:30,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:30,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:30,185 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 12 treesize of output 5 [2018-01-29 23:53:30,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:30,186 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-29 23:53:30,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:30,238 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 12 treesize of output 5 [2018-01-29 23:53:30,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:30,246 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-29 23:53:30,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:30,287 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-29 23:53:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2018-01-29 23:53:30,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:53:30,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-29 23:53:30,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:53:30,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:53:30,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-29 23:53:30,406 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 13 states. [2018-01-29 23:53:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:30,714 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-01-29 23:53:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:53:30,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2018-01-29 23:53:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:30,716 INFO L225 Difference]: With dead ends: 153 [2018-01-29 23:53:30,716 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 23:53:30,717 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 183 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-29 23:53:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 23:53:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-01-29 23:53:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-29 23:53:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-29 23:53:30,729 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 190 [2018-01-29 23:53:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:30,729 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-29 23:53:30,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:53:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-29 23:53:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-01-29 23:53:30,733 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:30,733 INFO L350 BasicCegarLoop]: trace histogram [20, 16, 16, 16, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:30,733 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:30,734 INFO L82 PathProgramCache]: Analyzing trace with hash 291385446, now seen corresponding path program 1 times [2018-01-29 23:53:30,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:30,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:30,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:30,735 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:30,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:30,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2018-01-29 23:53:30,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:30,903 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:30,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:30,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 524 proven. 62 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-01-29 23:53:31,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:31,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 17 [2018-01-29 23:53:31,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:53:31,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:53:31,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:53:31,104 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 17 states. [2018-01-29 23:53:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:31,344 INFO L93 Difference]: Finished difference Result 235 states and 249 transitions. [2018-01-29 23:53:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:53:31,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 248 [2018-01-29 23:53:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:31,345 INFO L225 Difference]: With dead ends: 235 [2018-01-29 23:53:31,346 INFO L226 Difference]: Without dead ends: 136 [2018-01-29 23:53:31,347 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:53:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-29 23:53:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 127. [2018-01-29 23:53:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-29 23:53:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-01-29 23:53:31,360 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 248 [2018-01-29 23:53:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:31,360 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-01-29 23:53:31,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:53:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-01-29 23:53:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-01-29 23:53:31,365 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:31,365 INFO L350 BasicCegarLoop]: trace histogram [24, 20, 20, 20, 20, 20, 20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:31,366 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash -379875350, now seen corresponding path program 2 times [2018-01-29 23:53:31,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:31,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:31,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:31,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:31,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:31,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2018-01-29 23:53:31,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:31,588 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:31,597 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:31,611 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:31,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:31,646 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:31,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 779 proven. 100 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2018-01-29 23:53:31,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:31,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 21 [2018-01-29 23:53:31,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:53:31,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:53:31,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:53:31,831 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 21 states. [2018-01-29 23:53:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:32,073 INFO L93 Difference]: Finished difference Result 259 states and 273 transitions. [2018-01-29 23:53:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:53:32,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 291 [2018-01-29 23:53:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:32,074 INFO L225 Difference]: With dead ends: 259 [2018-01-29 23:53:32,074 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 23:53:32,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:53:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 23:53:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 23:53:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 23:53:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 23:53:32,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2018-01-29 23:53:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:32,077 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 23:53:32,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:53:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 23:53:32,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 23:53:32,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 23:53:32,503 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 31 DAG size of output 21 [2018-01-29 23:53:32,662 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 67 DAG size of output 34 [2018-01-29 23:53:32,799 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,799 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,841 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:53:32,841 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,841 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse0 (= (select |#length| foo_~b.base) 32)) (.cse2 (= foo_~size 32)) (.cse1 (= 1 (select |#valid| foo_~b.base))) (.cse3 (= foo_~b.offset 0))) (or (not (= 0 |foo_#in~b.offset|)) (and .cse0 (and .cse1 (<= 1 foo_~i~1)) .cse2 .cse3) (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and .cse0 .cse2 .cse1 .cse3 (= foo_~i~1 0)) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-29 23:53:32,842 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-29 23:53:32,842 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 34) the Hoare annotation is: true [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,843 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 34) the Hoare annotation is: true [2018-01-29 23:53:32,843 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L28''''(line 28) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 34) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 29) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L395 ceAbstractionStarter]: At program point L28'''''(lines 28 32) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-01-29 23:53:32,844 INFO L399 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 34) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 34) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:53:32,845 INFO L395 ceAbstractionStarter]: At program point L26'(line 26) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|)) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|)))) (or (and .cse0 .cse1 (= 0 main_~i~3) .cse2 .cse3) (and (and (<= 1 main_~i~3) .cse0 .cse3) .cse1 .cse2))) [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L28''(lines 28 32) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L395 ceAbstractionStarter]: At program point L25'''''(lines 25 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 26) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-29 23:53:32,845 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L25''''''(lines 25 27) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L29'(lines 29 31) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L28''''''(lines 28 32) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L25''(lines 25 27) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-29 23:53:32,846 INFO L399 ceAbstractionStarter]: For program point L28'''(line 28) no Hoare annotation was computed. [2018-01-29 23:53:32,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,856 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,856 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,859 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,859 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,859 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,861 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,861 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,861 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:53:32 BoogieIcfgContainer [2018-01-29 23:53:32,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:53:32,868 INFO L168 Benchmark]: Toolchain (without parser) took 9353.93 ms. Allocated memory was 307.2 MB in the beginning and 631.2 MB in the end (delta: 324.0 MB). Free memory was 268.3 MB in the beginning and 479.9 MB in the end (delta: -211.7 MB). Peak memory consumption was 252.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:32,870 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 307.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:53:32,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.16 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 258.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:32,871 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 307.2 MB. Free memory was 258.3 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:32,871 INFO L168 Benchmark]: RCFGBuilder took 242.47 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 239.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:32,872 INFO L168 Benchmark]: TraceAbstraction took 8903.37 ms. Allocated memory was 307.2 MB in the beginning and 631.2 MB in the end (delta: 324.0 MB). Free memory was 239.7 MB in the beginning and 479.9 MB in the end (delta: -240.2 MB). Peak memory consumption was 224.3 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:32,874 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.20 ms. Allocated memory is still 307.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.16 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 258.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.42 ms. Allocated memory is still 307.2 MB. Free memory was 258.3 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.47 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 239.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8903.37 ms. Allocated memory was 307.2 MB in the beginning and 631.2 MB in the end (delta: 324.0 MB). Free memory was 239.7 MB in the beginning and 479.9 MB in the end (delta: -240.2 MB). Peak memory consumption was 224.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 29]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-01-29 23:53:32,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-29 23:53:32,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,885 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,885 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,886 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == b) || (((unknown-#length-unknown[b] == 32 && 1 == \valid[b] && 1 <= i) && size == 32) && b == 0)) || !(\valid[b] == 1)) || !(32 == \old(size))) || ((((unknown-#length-unknown[b] == 32 && size == 32) && 1 == \valid[b]) && b == 0) && i == 0)) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 28]: Loop Invariant [2018-01-29 23:53:32,887 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,887 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,888 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:32,888 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 6 error locations. SAFE Result, 8.8s OverallTime, 16 OverallIterations, 24 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 819 SDtfs, 1406 SDslu, 3502 SDs, 0 SdLazy, 1910 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1487 GetRequests, 1213 SyntacticMatches, 14 SemanticMatches, 260 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 161 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 37 PreInvPairs, 73 NumberOfFragments, 213 HoareAnnotationTreeSize, 37 FomulaSimplifications, 2848 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 987 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2655 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2627 ConstructedInterpolants, 140 QuantifiedInterpolants, 1036266 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2081 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 8819/9258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-53-32-894.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-53-32-894.csv Received shutdown request...