java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:24:18,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:24:18,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:24:18,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:24:18,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:24:18,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:24:18,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:24:18,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:24:18,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:24:18,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:24:18,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:24:18,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:24:18,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:24:18,855 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:24:18,856 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:24:18,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:24:18,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:24:18,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:24:18,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:24:18,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:24:18,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:24:18,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:24:18,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:24:18,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:24:18,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:24:18,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:24:18,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:24:18,872 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:24:18,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:24:18,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:24:18,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:24:18,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:24:18,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:24:18,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:24:18,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:24:18,884 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:24:18,885 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:24:18,885 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:24:18,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:24:18,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:24:18,886 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:24:18,886 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:24:18,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:24:18,887 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:24:18,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:24:18,887 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:24:18,887 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:24:18,887 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:24:18,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:24:18,888 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:24:18,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:24:18,888 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:24:18,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:24:18,889 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:24:18,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:24:18,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:24:18,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:24:18,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:24:18,891 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:24:18,891 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:24:18,892 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:24:18,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:24:18,938 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:24:18,942 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:24:18,944 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:24:18,944 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:24:18,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-29 23:24:19,103 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:24:19,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:24:19,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:24:19,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:24:19,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:24:19,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19, skipping insertion in model container [2018-01-29 23:24:19,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,131 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:24:19,172 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:24:19,283 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:24:19,297 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:24:19,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19 WrapperNode [2018-01-29 23:24:19,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:24:19,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:24:19,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:24:19,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:24:19,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... [2018-01-29 23:24:19,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:24:19,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:24:19,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:24:19,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:24:19,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:24:19,407 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:24:19,407 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:24:19,408 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:24:19,408 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:24:19,408 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:24:19,408 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:24:19,408 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:24:19,408 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:24:19,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:24:19,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:24:19,409 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:24:19,409 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-29 23:24:19,409 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-29 23:24:19,409 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:24:19,409 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:24:19,410 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-29 23:24:19,410 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:24:19,410 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:24:19,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:24:19,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:24:19,550 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-29 23:24:19,686 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:24:19,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:24:19 BoogieIcfgContainer [2018-01-29 23:24:19,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:24:19,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:24:19,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:24:19,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:24:19,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:24:19" (1/3) ... [2018-01-29 23:24:19,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e77ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:24:19, skipping insertion in model container [2018-01-29 23:24:19,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:24:19" (2/3) ... [2018-01-29 23:24:19,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e77ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:24:19, skipping insertion in model container [2018-01-29 23:24:19,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:24:19" (3/3) ... [2018-01-29 23:24:19,693 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-29 23:24:19,699 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:24:19,705 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-29 23:24:19,750 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:24:19,750 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:24:19,750 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:24:19,751 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:24:19,751 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:24:19,751 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:24:19,751 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:24:19,751 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:24:19,752 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:24:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-01-29 23:24:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-29 23:24:19,777 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:19,778 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-29 23:24:19,778 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 97524843, now seen corresponding path program 1 times [2018-01-29 23:24:19,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:19,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:19,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:19,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:19,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:19,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:19,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:19,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:24:19,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:24:19,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:24:19,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:24:19,991 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-01-29 23:24:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:20,214 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-29 23:24:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:24:20,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-29 23:24:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:20,226 INFO L225 Difference]: With dead ends: 78 [2018-01-29 23:24:20,226 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 23:24:20,229 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-29 23:24:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 23:24:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-29 23:24:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 23:24:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-01-29 23:24:20,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 5 [2018-01-29 23:24:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:20,265 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-01-29 23:24:20,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:24:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-01-29 23:24:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-29 23:24:20,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:20,265 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-29 23:24:20,265 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 97524844, now seen corresponding path program 1 times [2018-01-29 23:24:20,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:20,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:20,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:20,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:20,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:20,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:20,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:24:20,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:24:20,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:24:20,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:24:20,367 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 3 states. [2018-01-29 23:24:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:20,437 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-01-29 23:24:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:24:20,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-29 23:24:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:20,439 INFO L225 Difference]: With dead ends: 70 [2018-01-29 23:24:20,440 INFO L226 Difference]: Without dead ends: 66 [2018-01-29 23:24:20,440 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-29 23:24:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-29 23:24:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-29 23:24:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-29 23:24:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-01-29 23:24:20,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 5 [2018-01-29 23:24:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:20,451 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-01-29 23:24:20,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:24:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-01-29 23:24:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-29 23:24:20,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:20,452 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:20,452 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 381660014, now seen corresponding path program 1 times [2018-01-29 23:24:20,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:20,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:20,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:20,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:20,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:20,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:20,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:24:20,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:24:20,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:24:20,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:24:20,558 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 3 states. [2018-01-29 23:24:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:20,612 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-01-29 23:24:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:24:20,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-29 23:24:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:20,614 INFO L225 Difference]: With dead ends: 66 [2018-01-29 23:24:20,614 INFO L226 Difference]: Without dead ends: 64 [2018-01-29 23:24:20,615 INFO L553 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-29 23:24:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-29 23:24:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-29 23:24:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 23:24:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-01-29 23:24:20,623 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 15 [2018-01-29 23:24:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:20,624 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-01-29 23:24:20,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:24:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-01-29 23:24:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-29 23:24:20,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:20,625 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:20,625 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash 381660015, now seen corresponding path program 1 times [2018-01-29 23:24:20,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:20,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:20,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:20,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:20,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:20,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:20,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:24:20,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:24:20,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:24:20,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:24:20,766 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 4 states. [2018-01-29 23:24:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:20,903 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-01-29 23:24:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:24:20,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-29 23:24:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:20,905 INFO L225 Difference]: With dead ends: 64 [2018-01-29 23:24:20,905 INFO L226 Difference]: Without dead ends: 62 [2018-01-29 23:24:20,905 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:24:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-29 23:24:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-29 23:24:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-29 23:24:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-01-29 23:24:20,913 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2018-01-29 23:24:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:20,913 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-01-29 23:24:20,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:24:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-01-29 23:24:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-29 23:24:20,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:20,914 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:20,914 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1053441477, now seen corresponding path program 1 times [2018-01-29 23:24:20,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:20,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:20,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:20,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:20,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:21,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:21,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:24:21,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:24:21,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:24:21,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:24:21,078 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 5 states. [2018-01-29 23:24:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:21,135 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-01-29 23:24:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:24:21,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-29 23:24:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:21,136 INFO L225 Difference]: With dead ends: 62 [2018-01-29 23:24:21,137 INFO L226 Difference]: Without dead ends: 60 [2018-01-29 23:24:21,137 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:24:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-29 23:24:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-29 23:24:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-29 23:24:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-01-29 23:24:21,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 16 [2018-01-29 23:24:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:21,143 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-01-29 23:24:21,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:24:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-01-29 23:24:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:24:21,144 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:21,144 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:21,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337853, now seen corresponding path program 1 times [2018-01-29 23:24:21,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:21,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:21,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:21,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:21,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:21,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:21,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:24:21,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:24:21,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:24:21,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:24:21,210 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 3 states. [2018-01-29 23:24:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:21,248 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-01-29 23:24:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:24:21,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-29 23:24:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:21,250 INFO L225 Difference]: With dead ends: 60 [2018-01-29 23:24:21,250 INFO L226 Difference]: Without dead ends: 58 [2018-01-29 23:24:21,251 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-29 23:24:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-29 23:24:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-29 23:24:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-29 23:24:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-29 23:24:21,258 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 31 [2018-01-29 23:24:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:21,259 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-29 23:24:21,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:24:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-29 23:24:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:24:21,261 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:21,261 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:21,261 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337854, now seen corresponding path program 1 times [2018-01-29 23:24:21,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:21,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:21,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:21,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:21,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:21,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:21,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:24:21,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:24:21,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:24:21,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:24:21,422 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 8 states. [2018-01-29 23:24:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:21,609 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-01-29 23:24:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:24:21,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-29 23:24:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:21,610 INFO L225 Difference]: With dead ends: 58 [2018-01-29 23:24:21,610 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 23:24:21,611 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:24:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 23:24:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-29 23:24:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 23:24:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-29 23:24:21,616 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 31 [2018-01-29 23:24:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:21,616 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-29 23:24:21,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:24:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-29 23:24:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:24:21,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:21,617 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:21,618 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337855, now seen corresponding path program 1 times [2018-01-29 23:24:21,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:21,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:21,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:21,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:21,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:24:21,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:24:21,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:24:21,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:24:21,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:24:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:24:21,692 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-29 23:24:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:21,737 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-29 23:24:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:24:21,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-29 23:24:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:21,740 INFO L225 Difference]: With dead ends: 57 [2018-01-29 23:24:21,740 INFO L226 Difference]: Without dead ends: 55 [2018-01-29 23:24:21,741 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-29 23:24:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-29 23:24:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-29 23:24:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-29 23:24:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-01-29 23:24:21,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 31 [2018-01-29 23:24:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:21,748 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-01-29 23:24:21,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:24:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-01-29 23:24:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:24:21,749 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:21,750 INFO L350 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-29 23:24:21,750 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1059672691, now seen corresponding path program 1 times [2018-01-29 23:24:21,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:21,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:21,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:21,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:21,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:24:21,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:24:21,824 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:24:21,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:21,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:24:21,945 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-29 23:24:21,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:24:21,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-01-29 23:24:21,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:24:21,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:24:21,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:24:21,980 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 6 states. [2018-01-29 23:24:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:22,012 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-01-29 23:24:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:24:22,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-29 23:24:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:22,014 INFO L225 Difference]: With dead ends: 95 [2018-01-29 23:24:22,014 INFO L226 Difference]: Without dead ends: 63 [2018-01-29 23:24:22,015 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:24:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-29 23:24:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-01-29 23:24:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 23:24:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-29 23:24:22,023 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 42 [2018-01-29 23:24:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:22,023 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-29 23:24:22,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:24:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-29 23:24:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:24:22,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:22,025 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:24:22,025 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash -935763635, now seen corresponding path program 1 times [2018-01-29 23:24:22,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:22,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:22,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:22,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:22,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:24:22,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:24:22,133 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:24:22,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:22,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:24:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 23:24:22,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:24:22,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-29 23:24:22,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:24:22,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:24:22,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:24:22,365 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 8 states. [2018-01-29 23:24:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:22,550 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-01-29 23:24:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:24:22,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-29 23:24:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:22,551 INFO L225 Difference]: With dead ends: 104 [2018-01-29 23:24:22,552 INFO L226 Difference]: Without dead ends: 71 [2018-01-29 23:24:22,552 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:24:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-29 23:24:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-29 23:24:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 23:24:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-01-29 23:24:22,561 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 50 [2018-01-29 23:24:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:22,561 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-01-29 23:24:22,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:24:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-01-29 23:24:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 23:24:22,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:22,563 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-29 23:24:22,563 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash 677222157, now seen corresponding path program 2 times [2018-01-29 23:24:22,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:22,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:22,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:24:22,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:22,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 23:24:22,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:24:22,736 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:24:22,742 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:24:22,767 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:24:22,784 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:24:22,786 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:24:22,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:24:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:24:22,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:24:22,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-29 23:24:22,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:24:22,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:24:22,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:24:22,873 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 10 states. [2018-01-29 23:24:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:22,934 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-29 23:24:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:24:22,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-29 23:24:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:22,936 INFO L225 Difference]: With dead ends: 116 [2018-01-29 23:24:22,936 INFO L226 Difference]: Without dead ends: 79 [2018-01-29 23:24:22,937 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:24:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-29 23:24:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-01-29 23:24:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 23:24:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-01-29 23:24:22,946 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 58 [2018-01-29 23:24:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:22,946 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-01-29 23:24:22,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:24:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-01-29 23:24:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:24:22,947 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:22,948 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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-29 23:24:22,948 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1573892403, now seen corresponding path program 3 times [2018-01-29 23:24:22,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:22,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:22,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,949 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:24:22,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:22,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:24:23,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:24:23,099 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:24:23,108 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:24:23,137 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:24:23,162 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:24:23,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:24:23,360 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:24:23,362 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:24:23,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:24:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:24:23,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:24:23,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-01-29 23:24:23,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:24:23,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:24:23,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:24:23,516 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 13 states. [2018-01-29 23:24:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:24:23,658 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-01-29 23:24:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:24:23,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-01-29 23:24:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:24:23,660 INFO L225 Difference]: With dead ends: 128 [2018-01-29 23:24:23,660 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 23:24:23,660 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:24:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 23:24:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-01-29 23:24:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 23:24:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-01-29 23:24:23,667 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 66 [2018-01-29 23:24:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:24:23,668 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-01-29 23:24:23,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:24:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-01-29 23:24:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 23:24:23,669 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:24:23,669 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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-29 23:24:23,669 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:24:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1511950477, now seen corresponding path program 4 times [2018-01-29 23:24:23,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:24:23,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:24:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:23,670 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:24:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:24:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:24:23,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:24:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 125 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 23:24:25,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:24:25,055 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:24:25,065 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:24:25,105 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:24:25,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:24:25,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:24:25,196 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-29 23:24:25,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:25,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:25,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:25,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-29 23:24:32,274 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-01-29 23:24:32,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-29 23:24:32,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 74 [2018-01-29 23:24:32,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,330 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:24:32,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 73 [2018-01-29 23:24:32,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:24:32,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 46 [2018-01-29 23:24:32,361 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:24:32,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 28 [2018-01-29 23:24:32,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-01-29 23:24:32,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-01-29 23:24:32,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-01-29 23:24:32,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:32,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-01-29 23:24:32,474 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,487 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:24:32,522 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-01-29 23:24:32,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-29 23:24:32,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:32,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-01-29 23:24:37,004 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-01-29 23:24:37,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-29 23:24:37,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-01-29 23:24:37,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-01-29 23:24:37,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-01-29 23:24:37,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:24:37,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-01-29 23:24:37,074 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:24:37,151 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-01-29 23:24:37,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2018-01-29 23:24:37,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2018-01-29 23:24:37,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:24:37,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:3 [2018-01-29 23:24:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 92 refuted. 20 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:24:37,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:24:37,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 42 [2018-01-29 23:24:37,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 23:24:37,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 23:24:37,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1603, Unknown=16, NotChecked=0, Total=1806 [2018-01-29 23:24:37,324 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 43 states. [2018-01-29 23:25:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:25:10,459 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-01-29 23:25:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:25:10,459 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 74 [2018-01-29 23:25:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:25:10,461 INFO L225 Difference]: With dead ends: 109 [2018-01-29 23:25:10,461 INFO L226 Difference]: Without dead ends: 108 [2018-01-29 23:25:10,463 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=423, Invalid=3700, Unknown=37, NotChecked=0, Total=4160 [2018-01-29 23:25:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-29 23:25:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2018-01-29 23:25:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 23:25:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-01-29 23:25:10,476 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2018-01-29 23:25:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:25:10,476 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-01-29 23:25:10,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 23:25:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-01-29 23:25:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 23:25:10,478 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:25:10,478 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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-29 23:25:10,478 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:25:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1511950478, now seen corresponding path program 1 times [2018-01-29 23:25:10,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:25:10,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:25:10,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:25:10,480 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:25:10,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:25:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:25:10,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:25:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 23:25:12,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:25:12,062 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:25:12,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:25:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:25:12,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:25:12,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:25:12,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-29 23:25:12,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:12,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:12,142 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:25:12,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-29 23:25:12,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:25:12,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:25:12,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:12,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-29 23:25:12,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-29 23:25:12,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-01-29 23:25:12,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:12,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:12,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-29 23:25:13,129 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-01-29 23:25:13,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2018-01-29 23:25:13,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-01-29 23:25:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-01-29 23:25:13,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-01-29 23:25:13,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 105 [2018-01-29 23:25:13,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:13,256 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-01-29 23:25:13,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,337 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 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-29 23:25:13,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,351 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-29 23:25:13,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-01-29 23:25:13,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,424 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-29 23:25:13,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:25:13,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 23:25:13,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-01-29 23:25:13,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2018-01-29 23:25:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 80 [2018-01-29 23:25:13,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-29 23:25:13,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:13,622 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-01-29 23:25:13,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:13,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:25:13,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-01-29 23:25:13,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:25:13,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-01-29 23:25:13,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:25:13,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-29 23:25:13,746 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:13,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-29 23:25:13,767 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:25:13,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:25:13,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-29 23:25:13,824 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-01-29 23:25:13,998 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 63 DAG size of output 32 [2018-01-29 23:26:08,216 WARN L146 SmtUtils]: Spent 52432ms on a formula simplification. DAG size of input: 433 DAG size of output 191 [2018-01-29 23:26:08,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 126 [2018-01-29 23:26:08,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 182 [2018-01-29 23:26:08,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-01-29 23:26:08,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 173 [2018-01-29 23:26:08,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:08,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 157 treesize of output 212 [2018-01-29 23:26:08,445 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-01-29 23:26:08,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:08,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:08,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:08,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:26:09,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 124 [2018-01-29 23:26:09,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 135 [2018-01-29 23:26:09,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-29 23:26:09,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-29 23:26:09,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:09,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-29 23:26:09,431 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:09,446 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:09,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:09,485 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:09,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:10,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 113 [2018-01-29 23:26:10,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 169 [2018-01-29 23:26:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-01-29 23:26:10,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 173 [2018-01-29 23:26:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 208 [2018-01-29 23:26:10,255 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-01-29 23:26:10,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 135 [2018-01-29 23:26:10,509 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-01-29 23:26:10,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:10,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 212 [2018-01-29 23:26:10,771 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 8 xjuncts. [2018-01-29 23:26:10,872 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:10,904 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:10,993 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,059 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:26:11,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 137 [2018-01-29 23:26:11,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 148 [2018-01-29 23:26:11,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,472 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-29 23:26:11,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-29 23:26:11,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:11,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-29 23:26:11,503 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,522 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,530 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,571 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,628 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:11,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 4 dim-2 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-01-29 23:26:11,758 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 23 variables, input treesize:1037, output treesize:555 [2018-01-29 23:26:12,316 WARN L146 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 192 DAG size of output 102 [2018-01-29 23:26:12,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:12,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 113 [2018-01-29 23:26:12,346 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 33 treesize of output 26 [2018-01-29 23:26:12,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:12,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:12,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 113 [2018-01-29 23:26:12,448 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 48 treesize of output 39 [2018-01-29 23:26:12,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:12,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:12,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-29 23:26:12,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:269, output treesize:46 [2018-01-29 23:26:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 128 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:26:12,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:26:12,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2018-01-29 23:26:12,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-29 23:26:12,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-29 23:26:12,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3103, Unknown=21, NotChecked=0, Total=3422 [2018-01-29 23:26:12,751 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 59 states. [2018-01-29 23:26:16,351 WARN L146 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 141 DAG size of output 87 [2018-01-29 23:26:18,587 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 38 DAG size of output 38 [2018-01-29 23:26:18,930 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 40 DAG size of output 40 [2018-01-29 23:26:20,121 WARN L146 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 111 DAG size of output 86 [2018-01-29 23:26:22,812 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 107 DAG size of output 105 [2018-01-29 23:26:23,250 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 121 DAG size of output 108 [2018-01-29 23:26:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:26:23,445 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-01-29 23:26:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 23:26:23,445 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 74 [2018-01-29 23:26:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:26:23,448 INFO L225 Difference]: With dead ends: 124 [2018-01-29 23:26:23,448 INFO L226 Difference]: Without dead ends: 123 [2018-01-29 23:26:23,450 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=707, Invalid=7446, Unknown=37, NotChecked=0, Total=8190 [2018-01-29 23:26:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-29 23:26:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2018-01-29 23:26:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 23:26:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-01-29 23:26:23,471 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-01-29 23:26:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:26:23,472 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-01-29 23:26:23,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-29 23:26:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-01-29 23:26:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 23:26:23,473 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:26:23,473 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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, 1, 1, 1, 1] [2018-01-29 23:26:23,473 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-29 23:26:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1620862641, now seen corresponding path program 1 times [2018-01-29 23:26:23,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:26:23,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:26:23,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:26:23,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:26:23,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:26:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:26:23,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:26:25,335 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 202 DAG size of output 17 [2018-01-29 23:26:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 42 proven. 91 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:26:26,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:26:26,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:26:26,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:26:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:26:26,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:26:26,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:26:26,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:26:26,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:26,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:26,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:26,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-01-29 23:26:26,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:26,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-01-29 23:26:26,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 23 [2018-01-29 23:26:26,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:26,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:26,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-29 23:26:26,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-29 23:26:26,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:26,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:26,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:26,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-01-29 23:26:33,361 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 115 DAG size of output 53 [2018-01-29 23:26:33,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 79 [2018-01-29 23:26:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 106 [2018-01-29 23:26:33,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,419 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:33,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 98 [2018-01-29 23:26:33,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,431 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:33,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-01-29 23:26:33,440 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:33,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2018-01-29 23:26:33,443 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-01-29 23:26:33,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-01-29 23:26:33,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 71 [2018-01-29 23:26:33,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:33,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 99 [2018-01-29 23:26:33,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,582 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:33,624 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:239, output treesize:121 [2018-01-29 23:26:34,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-01-29 23:26:34,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-01-29 23:26:34,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-29 23:26:34,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,258 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 0 case distinctions, treesize of input 21 treesize of output 36 [2018-01-29 23:26:34,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-29 23:26:34,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-01-29 23:26:34,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,281 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:26:34,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:26:34,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 73 [2018-01-29 23:26:34,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,349 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,353 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 107 [2018-01-29 23:26:34,371 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:34,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 77 [2018-01-29 23:26:34,421 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-29 23:26:34,447 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:34,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:26:34,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 81 [2018-01-29 23:26:34,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,479 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,485 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,486 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:34,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 116 [2018-01-29 23:26:34,505 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:34,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:34,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-01-29 23:26:34,565 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:34,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-29 23:26:34,593 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:34,610 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:26:34,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-29 23:26:34,650 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:130, output treesize:119 [2018-01-29 23:26:40,070 WARN L146 SmtUtils]: Spent 501ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-01-29 23:26:40,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 147 [2018-01-29 23:26:40,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 220 [2018-01-29 23:26:40,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,234 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 67 treesize of output 166 [2018-01-29 23:26:40,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,288 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 25 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 151 treesize of output 162 [2018-01-29 23:26:40,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,361 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 23 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 121 [2018-01-29 23:26:40,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:26:40,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:40,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,521 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 145 [2018-01-29 23:26:40,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 149 [2018-01-29 23:26:40,636 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:40,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,768 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 130 [2018-01-29 23:26:40,818 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:40,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,887 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 109 [2018-01-29 23:26:40,927 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:40,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:40,981 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:26:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 103 [2018-01-29 23:26:41,018 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,044 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 147 [2018-01-29 23:26:41,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-29 23:26:41,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-29 23:26:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-29 23:26:41,427 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,443 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,453 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,475 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:41,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:41,589 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:313, output treesize:198 [2018-01-29 23:26:41,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 139 [2018-01-29 23:26:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:26:41,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 115 [2018-01-29 23:26:41,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:42,220 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 55 treesize of output 42 [2018-01-29 23:26:42,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:26:42,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:26:42,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:26:42,343 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:178, output treesize:47 [2018-01-29 23:26:42,421 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~4.base| Int) (|main_#t~mem3.base| Int)) (let ((.cse1 (store |c_old(#valid)| |foo_~#p~4.base| 1))) (let ((.cse0 (store (store .cse1 |main_#t~mem3.base| 1) |foo_~#p~4.base| 0))) (and (= (select .cse0 |c_main_~#p~5.base|) 0) (not (= |main_#t~mem3.base| 0)) (= (select .cse1 |main_#t~mem3.base|) 0) (= (select |c_old(#valid)| |foo_~#p~4.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#p~5.base| 1) |main_#t~mem3.base| 0)))))) is different from true [2018-01-29 23:26:42,426 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~4.base| Int) (|main_#t~mem3.base| Int) (|main_~#p~5.base| Int)) (let ((.cse1 (store |c_old(#valid)| |foo_~#p~4.base| 1))) (let ((.cse0 (store (store .cse1 |main_#t~mem3.base| 1) |foo_~#p~4.base| 0))) (and (= |c_#valid| (store (store (store .cse0 |main_~#p~5.base| 1) |main_#t~mem3.base| 0) |main_~#p~5.base| 0)) (= (select .cse0 |main_~#p~5.base|) 0) (not (= |main_#t~mem3.base| 0)) (= (select .cse1 |main_#t~mem3.base|) 0) (= (select |c_old(#valid)| |foo_~#p~4.base|) 0))))) is different from true [2018-01-29 23:26:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 4 proven. 99 refuted. 24 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-29 23:26:42,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:26:42,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-29 23:26:42,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-29 23:26:42,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-29 23:26:42,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2733, Unknown=52, NotChecked=218, Total=3306 [2018-01-29 23:26:42,492 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 58 states. Received shutdown request... [2018-01-29 23:26:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:26:49,617 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:26:49,658 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:26:49,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:26:49 BoogieIcfgContainer [2018-01-29 23:26:49,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:26:49,659 INFO L168 Benchmark]: Toolchain (without parser) took 150555.33 ms. Allocated memory was 297.3 MB in the beginning and 662.2 MB in the end (delta: 364.9 MB). Free memory was 257.3 MB in the beginning and 317.9 MB in the end (delta: -60.6 MB). Peak memory consumption was 304.3 MB. Max. memory is 5.3 GB. [2018-01-29 23:26:49,660 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:26:49,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.92 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:26:49,660 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 ms. Allocated memory is still 297.3 MB. Free memory was 245.2 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:26:49,660 INFO L168 Benchmark]: RCFGBuilder took 333.64 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 221.7 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:26:49,660 INFO L168 Benchmark]: TraceAbstraction took 149970.66 ms. Allocated memory was 297.3 MB in the beginning and 662.2 MB in the end (delta: 364.9 MB). Free memory was 221.7 MB in the beginning and 317.9 MB in the end (delta: -96.2 MB). Peak memory consumption was 268.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:26:49,661 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.17 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.92 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.88 ms. Allocated memory is still 297.3 MB. Free memory was 245.2 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.64 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 221.7 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 149970.66 ms. Allocated memory was 297.3 MB in the beginning and 662.2 MB in the end (delta: 364.9 MB). Free memory was 221.7 MB in the beginning and 317.9 MB in the end (delta: -96.2 MB). Peak memory consumption was 268.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 16 states, 58 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 67 locations, 23 error locations. TIMEOUT Result, 149.9s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 52.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 557 SDtfs, 685 SDslu, 1671 SDs, 0 SdLazy, 4092 SolverSat, 309 SolverUnsat, 193 SolverUnknown, 0 SolverNotchecked, 38.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 385 SyntacticMatches, 31 SemanticMatches, 273 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5120 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 96 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 95.9s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1011 ConstructedInterpolants, 144 QuantifiedInterpolants, 1686302 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 270/1104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-26-49-668.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-26-49-668.csv Completed graceful shutdown