java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:51:06,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:51:06,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:51:06,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:51:06,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:51:06,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:51:06,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:51:06,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:51:06,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:51:06,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:51:06,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:51:06,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:51:06,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:51:06,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:51:06,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:51:06,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:51:06,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:51:06,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:51:06,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:51:06,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:51:06,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:51:06,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:51:06,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:51:06,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:51:06,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:51:06,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:51:06,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:51:06,967 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:51:06,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:51:06,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:51:06,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:51:06,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:51:06,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:51:06,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:51:06,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:51:06,978 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:51:06,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:51:06,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:51:06,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:51:06,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:51:06,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:51:06,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:51:06,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:51:06,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:51:06,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:51:06,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:51:06,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:51:06,981 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:51:06,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:51:06,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:06,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:51:06,981 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:51:06,982 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:51:06,983 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:51:06,983 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:51:07,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:51:07,026 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:51:07,030 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:51:07,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:51:07,031 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:51:07,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-24 15:51:07,130 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:51:07,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:51:07,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:07,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:51:07,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:51:07,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e9bcfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07, skipping insertion in model container [2018-01-24 15:51:07,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:07,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:07,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:07,305 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:07,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07 WrapperNode [2018-01-24 15:51:07,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:07,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:51:07,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:51:07,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:51:07,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... [2018-01-24 15:51:07,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:51:07,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:51:07,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:51:07,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:51:07,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:07,399 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:51:07,399 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:51:07,399 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-24 15:51:07,399 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:51:07,400 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:51:07,400 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:51:07,401 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:51:07,401 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:51:07,613 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:51:07,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:07 BoogieIcfgContainer [2018-01-24 15:51:07,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:51:07,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:51:07,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:51:07,618 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:51:07,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:51:07" (1/3) ... [2018-01-24 15:51:07,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39831a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:07, skipping insertion in model container [2018-01-24 15:51:07,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:07" (2/3) ... [2018-01-24 15:51:07,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39831a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:07, skipping insertion in model container [2018-01-24 15:51:07,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:07" (3/3) ... [2018-01-24 15:51:07,621 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-24 15:51:07,628 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:51:07,633 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 15:51:07,669 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:51:07,669 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:51:07,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:51:07,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:51:07,669 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:51:07,669 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:51:07,669 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:51:07,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:51:07,670 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:51:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-24 15:51:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:51:07,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:07,695 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:07,695 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-01-24 15:51:07,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:07,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:07,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:07,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:07,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:07,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:07,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-24 15:51:07,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:07,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:51:07,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:07,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 15:51:07,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 15:51:07,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:51:07,835 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-24 15:51:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:07,863 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2018-01-24 15:51:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 15:51:07,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 15:51:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:07,873 INFO L225 Difference]: With dead ends: 128 [2018-01-24 15:51:07,873 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:51:07,878 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:51:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:51:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-24 15:51:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:51:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 15:51:07,914 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-01-24 15:51:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:07,914 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 15:51:07,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 15:51:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 15:51:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:51:07,915 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:07,916 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:07,916 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-01-24 15:51:07,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:07,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:07,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:07,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:07,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:07,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:08,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:08,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:51:08,055 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:08,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:08,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:08,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:08,058 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-01-24 15:51:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:08,124 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 15:51:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:08,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 15:51:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:08,128 INFO L225 Difference]: With dead ends: 86 [2018-01-24 15:51:08,128 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 15:51:08,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 15:51:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-01-24 15:51:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 15:51:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-24 15:51:08,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-01-24 15:51:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:08,145 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-24 15:51:08,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-24 15:51:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:51:08,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:08,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:08,146 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-01-24 15:51:08,146 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:08,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:08,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:08,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:08,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:08,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:51:08,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:08,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:08,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:08,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:51:08,266 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-01-24 15:51:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:08,376 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2018-01-24 15:51:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:08,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 15:51:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:08,377 INFO L225 Difference]: With dead ends: 139 [2018-01-24 15:51:08,377 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 15:51:08,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 15:51:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-01-24 15:51:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:51:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 15:51:08,385 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-01-24 15:51:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:08,385 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 15:51:08,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 15:51:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:51:08,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:08,386 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:08,386 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-01-24 15:51:08,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:08,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:08,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:08,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:08,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:08,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:08,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:08,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:08,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:08,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:08,443 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-01-24 15:51:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:08,535 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-24 15:51:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:08,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 15:51:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:08,538 INFO L225 Difference]: With dead ends: 79 [2018-01-24 15:51:08,538 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 15:51:08,539 INFO L525 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-24 15:51:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 15:51:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 15:51:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 15:51:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-24 15:51:08,549 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-01-24 15:51:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:08,550 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-24 15:51:08,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-24 15:51:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:51:08,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:08,551 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:08,551 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-01-24 15:51:08,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:08,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:08,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:08,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:08,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:08,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:51:08,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:08,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:51:08,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:51:08,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:08,628 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-01-24 15:51:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:08,757 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-01-24 15:51:08,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:51:08,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 15:51:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:08,759 INFO L225 Difference]: With dead ends: 149 [2018-01-24 15:51:08,759 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 15:51:08,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:51:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 15:51:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-01-24 15:51:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 15:51:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-24 15:51:08,770 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-01-24 15:51:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:08,771 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-24 15:51:08,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:51:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-24 15:51:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:51:08,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:08,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:08,772 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-01-24 15:51:08,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:08,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:08,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:08,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:08,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:08,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:51:08,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:08,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:08,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:08,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:08,837 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-01-24 15:51:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:08,872 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-24 15:51:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:08,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 15:51:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:08,874 INFO L225 Difference]: With dead ends: 147 [2018-01-24 15:51:08,874 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 15:51:08,874 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-24 15:51:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 15:51:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-01-24 15:51:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 15:51:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 15:51:08,885 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-01-24 15:51:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:08,885 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 15:51:08,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 15:51:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:51:08,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:08,886 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:08,886 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-01-24 15:51:08,886 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:08,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:08,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:08,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:08,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:09,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:09,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:09,029 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:09,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:09,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:09,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:09,030 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-01-24 15:51:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:09,208 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-01-24 15:51:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:09,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 15:51:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:09,219 INFO L225 Difference]: With dead ends: 88 [2018-01-24 15:51:09,219 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 15:51:09,219 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:51:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 15:51:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 15:51:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 15:51:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-24 15:51:09,230 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-01-24 15:51:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:09,230 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-24 15:51:09,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-24 15:51:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:51:09,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:09,232 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:09,232 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:09,232 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-01-24 15:51:09,232 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:09,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:09,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:09,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:09,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:09,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:51:09,394 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:09,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:51:09,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:51:09,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:09,395 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-01-24 15:51:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:09,644 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 15:51:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:51:09,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-24 15:51:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:09,645 INFO L225 Difference]: With dead ends: 103 [2018-01-24 15:51:09,646 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 15:51:09,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:51:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 15:51:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-01-24 15:51:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 15:51:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-01-24 15:51:09,657 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-01-24 15:51:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:09,658 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-01-24 15:51:09,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:51:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-01-24 15:51:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:51:09,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:09,659 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:09,660 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-01-24 15:51:09,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:09,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:09,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:09,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:09,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:09,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:09,761 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:09,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:09,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:09,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:09,763 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-01-24 15:51:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:09,843 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-24 15:51:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:09,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 15:51:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:09,845 INFO L225 Difference]: With dead ends: 97 [2018-01-24 15:51:09,845 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 15:51:09,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:51:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 15:51:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-24 15:51:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 15:51:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 15:51:09,857 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-01-24 15:51:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:09,858 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 15:51:09,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 15:51:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:51:09,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:09,859 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:09,859 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-01-24 15:51:09,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:09,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:09,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:09,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:09,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:10,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:10,097 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:10,098 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-01-24 15:51:10,100 INFO L201 CegarAbsIntRunner]: [0], [4], [7], [19], [20], [21], [22], [23], [24], [25], [29], [32], [34], [37], [48], [54], [55], [56], [57], [61], [62], [63], [67], [72], [74], [75], [78], [80], [114], [115], [116], [117], [118], [120], [121] [2018-01-24 15:51:10,146 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:10,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:10,999 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:11,001 INFO L268 AbstractInterpreter]: Visited 35 different actions 62 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-24 15:51:11,011 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:11,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:11,011 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:11,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:11,025 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:11,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:11,102 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-24 15:51:11,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,138 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-24 15:51:11,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:51:11,305 WARN L1029 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-24 15:51:11,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 15:51:11,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 15:51:11,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:11,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-24 15:51:11,533 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (= (* 4 v_prenex_1) (select |c_#length| v_prenex_2)))) is different from true [2018-01-24 15:51:11,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:11,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:11,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:51:11,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,582 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 14 treesize of output 17 [2018-01-24 15:51:11,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:11,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-01-24 15:51:11,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:11,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 15:51:11,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 15:51:11,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:11,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:11,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:51:11,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:11,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 15:51:11,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-01-24 15:51:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 15:51:11,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:12,175 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-24 15:51:12,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:12,348 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:12,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 15:51:12,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:12,369 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:12,370 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:12,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-01-24 15:51:12,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:12,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:51:12,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:20 [2018-01-24 15:51:14,550 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 48 [2018-01-24 15:51:18,727 WARN L146 SmtUtils]: Spent 1130ms on a formula simplification. DAG size of input: 95 DAG size of output 34 [2018-01-24 15:51:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:21,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:21,199 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:21,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:21,203 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:21,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:21,257 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-24 15:51:21,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:21,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:21,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:21,341 WARN L1029 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~3.base| (* 4 foo_~n)))) is different from true [2018-01-24 15:51:21,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 15:51:21,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:21,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:21,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-01-24 15:51:21,377 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_27 Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| v_prenex_27))) (exists ((v_prenex_28 Int)) (= (store |c_old(#length)| |c_foo_~#a~3.base| (* 4 v_prenex_28)) |c_#length|))) is different from true [2018-01-24 15:51:21,384 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-24 15:51:21,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:21,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:21,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-01-24 15:51:21,394 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_27 Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| v_prenex_27))) (exists ((v_prenex_28 Int) (|foo_~#a~3.base| Int)) (and (= (select |c_#valid| |foo_~#a~3.base|) 0) (= (store |c_old(#length)| |foo_~#a~3.base| (* 4 v_prenex_28)) |c_#length|)))) is different from true [2018-01-24 15:51:21,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 15:51:21,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 15:51:21,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-01-24 15:51:21,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-01-24 15:51:21,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:21,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:21,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:21,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-24 15:51:21,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:21,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 15:51:21,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:51:21,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 15:51:21,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:39, output treesize:52 [2018-01-24 15:51:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 15:51:21,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:26,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 15:51:26,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:26,129 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:26,130 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:26,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 15:51:26,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:26,156 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:26,156 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:26,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-01-24 15:51:26,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:26,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-01-24 15:51:26,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:26,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 15:51:26,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:59, output treesize:28 [2018-01-24 15:51:36,651 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:36,652 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:51:36,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 15:51:36,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:36,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-01-24 15:51:36,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:36,680 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 15:51:36,683 INFO L168 Benchmark]: Toolchain (without parser) took 29551.56 ms. Allocated memory was 306.2 MB in the beginning and 558.9 MB in the end (delta: 252.7 MB). Free memory was 265.5 MB in the beginning and 320.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 197.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:36,683 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:51:36,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.49 ms. Allocated memory is still 306.2 MB. Free memory was 265.5 MB in the beginning and 256.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:36,684 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 ms. Allocated memory is still 306.2 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:36,684 INFO L168 Benchmark]: RCFGBuilder took 268.72 ms. Allocated memory is still 306.2 MB. Free memory was 254.4 MB in the beginning and 234.8 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:36,684 INFO L168 Benchmark]: TraceAbstraction took 29066.68 ms. Allocated memory was 306.2 MB in the beginning and 558.9 MB in the end (delta: 252.7 MB). Free memory was 234.8 MB in the beginning and 320.7 MB in the end (delta: -85.9 MB). Peak memory consumption was 166.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:36,685 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.12 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.49 ms. Allocated memory is still 306.2 MB. Free memory was 265.5 MB in the beginning and 256.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.19 ms. Allocated memory is still 306.2 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.72 ms. Allocated memory is still 306.2 MB. Free memory was 254.4 MB in the beginning and 234.8 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 29066.68 ms. Allocated memory was 306.2 MB in the beginning and 558.9 MB in the end (delta: 252.7 MB). Free memory was 234.8 MB in the beginning and 320.7 MB in the end (delta: -85.9 MB). Peak memory consumption was 166.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 360 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.377787 RENAME_VARIABLES(MILLISECONDS) : 0.272245 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.337128 PROJECTAWAY(MILLISECONDS) : 0.131221 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.110691 DISJOIN(MILLISECONDS) : 0.170959 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.306512 ADD_EQUALITY(MILLISECONDS) : 0.056929 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015415 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 174 #UNFREEZE : 0 #CONJOIN : 153 #PROJECTAWAY : 143 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 172 #ADD_EQUALITY : 61 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-51-36-693.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-51-36-693.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-51-36-693.csv Received shutdown request...