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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:41:15,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:41:15,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:41:15,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:41:15,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:41:15,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:41:15,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:41:15,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:41:15,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:41:15,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:41:15,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:41:15,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:41:15,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:41:15,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:41:15,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:41:15,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:41:15,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:41:15,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:41:15,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:41:15,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:41:15,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:41:15,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:41:15,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:41:15,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:41:15,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:41:15,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:41:15,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:41:15,354 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:41:15,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:41:15,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:41:15,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:41:15,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:41:15,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:41:15,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:41:15,367 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:41:15,367 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:41:15,367 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:41:15,367 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:41:15,368 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:41:15,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:41:15,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:41:15,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:41:15,369 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:41:15,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:41:15,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:41:15,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:41:15,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:41:15,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:41:15,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:41:15,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:41:15,371 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:41:15,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:41:15,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:41:15,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:41:15,372 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:41:15,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:41:15,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:41:15,374 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:41:15,375 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:41:15,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:41:15,419 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:41:15,422 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:41:15,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:41:15,424 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:41:15,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-23 14:41:15,533 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:41:15,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:41:15,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:41:15,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:41:15,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:41:15,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c70ee5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15, skipping insertion in model container [2018-01-23 14:41:15,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,561 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:41:15,576 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:41:15,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:41:15,708 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:41:15,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15 WrapperNode [2018-01-23 14:41:15,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:41:15,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:41:15,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:41:15,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:41:15,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (1/1) ... [2018-01-23 14:41:15,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:41:15,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:41:15,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:41:15,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:41:15,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (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-23 14:41:15,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:41:15,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:41:15,794 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-23 14:41:15,794 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-23 14:41:15,794 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:41:15,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:41:15,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:41:15,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:41:15,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:41:15,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:41:16,013 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:41:16,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:41:16 BoogieIcfgContainer [2018-01-23 14:41:16,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:41:16,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:41:16,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:41:16,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:41:16,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:41:15" (1/3) ... [2018-01-23 14:41:16,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef2ac1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:41:16, skipping insertion in model container [2018-01-23 14:41:16,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:41:15" (2/3) ... [2018-01-23 14:41:16,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef2ac1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:41:16, skipping insertion in model container [2018-01-23 14:41:16,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:41:16" (3/3) ... [2018-01-23 14:41:16,022 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-23 14:41:16,030 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:41:16,036 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-23 14:41:16,072 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:41:16,072 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:41:16,072 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:41:16,072 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:41:16,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:41:16,072 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:41:16,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:41:16,073 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == barErr0EnsuresViolation======== [2018-01-23 14:41:16,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:41:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:41:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:41:16,101 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,102 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,102 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr0EnsuresViolation]=== [2018-01-23 14:41:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash -492377012, now seen corresponding path program 1 times [2018-01-23 14:41:16,110 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:16,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:16,299 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-23 14:41:16,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:41:16,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:41:16,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:41:16,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:41:16,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,321 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:41:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:16,348 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-23 14:41:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:41:16,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:41:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:16,355 INFO L225 Difference]: With dead ends: 114 [2018-01-23 14:41:16,355 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:41:16,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:41:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:41:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:41:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:41:16,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-23 14:41:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:16,380 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:41:16,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:41:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:41:16,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:41:16,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:41:16,481 INFO L404 ceAbstractionStarter]: At program point L13'''(lines 13 15) the Hoare annotation is: true [2018-01-23 14:41:16,481 INFO L401 ceAbstractionStarter]: For program point barErr0EnsuresViolation(lines 11 17) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point L13''(lines 13 15) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L404 ceAbstractionStarter]: At program point barENTRY(lines 11 17) the Hoare annotation is: true [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point L13''''(lines 13 15) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point barFINAL(lines 11 17) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point L14'(line 14) no Hoare annotation was computed. [2018-01-23 14:41:16,482 INFO L401 ceAbstractionStarter]: For program point barEXIT(lines 11 17) no Hoare annotation was computed. [2018-01-23 14:41:16,483 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,483 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,483 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 43) the Hoare annotation is: true [2018-01-23 14:41:16,483 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,483 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 20 29) no Hoare annotation was computed. [2018-01-23 14:41:16,483 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L25'(lines 25 27) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,484 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 20 29) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 20 29) the Hoare annotation is: true [2018-01-23 14:41:16,485 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L404 ceAbstractionStarter]: At program point L22''''(lines 22 24) the Hoare annotation is: true [2018-01-23 14:41:16,485 INFO L404 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: true [2018-01-23 14:41:16,485 INFO L401 ceAbstractionStarter]: For program point fooErr0EnsuresViolation(lines 20 29) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-23 14:41:16,485 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 43) the Hoare annotation is: true [2018-01-23 14:41:16,486 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,486 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 43) the Hoare annotation is: true [2018-01-23 14:41:16,486 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,486 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-23 14:41:16,486 INFO L404 ceAbstractionStarter]: At program point L36''(lines 36 40) the Hoare annotation is: true [2018-01-23 14:41:16,486 INFO L401 ceAbstractionStarter]: For program point L33''(lines 33 35) no Hoare annotation was computed. [2018-01-23 14:41:16,486 INFO L401 ceAbstractionStarter]: For program point L34''(line 34) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L404 ceAbstractionStarter]: At program point L33'''(lines 33 35) the Hoare annotation is: true [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point L32''(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point L37'(line 37) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point L32''''(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point L32'''''(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 31 42) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point L36'''(lines 36 40) no Hoare annotation was computed. [2018-01-23 14:41:16,487 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 31 42) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L32'''(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L404 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: true [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L34'''(line 34) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L33''''(lines 33 35) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-01-23 14:41:16,488 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 31 42) no Hoare annotation was computed. [2018-01-23 14:41:16,489 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 31 42) the Hoare annotation is: true [2018-01-23 14:41:16,489 INFO L401 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-01-23 14:41:16,489 INFO L401 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-01-23 14:41:16,489 INFO L401 ceAbstractionStarter]: For program point L34'(line 34) no Hoare annotation was computed. [2018-01-23 14:41:16,489 INFO L401 ceAbstractionStarter]: For program point L32'(line 32) no Hoare annotation was computed. [2018-01-23 14:41:16,493 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:41:16,493 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:41:16,493 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:41:16,493 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:41:16,493 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:41:16,493 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:41:16,494 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:41:16,494 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:41:16,494 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:41:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:41:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:41:16,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,497 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:41:16,497 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:41:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 136143, now seen corresponding path program 1 times [2018-01-23 14:41:16,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:41:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:41:16,527 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:41:16,531 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:41:16,536 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:41:16,536 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:41:16,536 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:41:16,536 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:41:16,536 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:41:16,536 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:41:16,536 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:41:16,537 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-23 14:41:16,537 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:41:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:41:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:41:16,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,541 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,541 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-23 14:41:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1220349549, now seen corresponding path program 1 times [2018-01-23 14:41:16,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:16,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:16,582 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-23 14:41:16,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:41:16,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:41:16,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:41:16,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:41:16,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,584 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:41:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:16,593 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-23 14:41:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:41:16,593 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-23 14:41:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:16,596 INFO L225 Difference]: With dead ends: 114 [2018-01-23 14:41:16,596 INFO L226 Difference]: Without dead ends: 43 [2018-01-23 14:41:16,597 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-23 14:41:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-23 14:41:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:41:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-23 14:41:16,610 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-23 14:41:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:16,610 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-23 14:41:16,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:41:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-23 14:41:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:41:16,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,612 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,612 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr0EnsuresViolation]=== [2018-01-23 14:41:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash 390316661, now seen corresponding path program 1 times [2018-01-23 14:41:16,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:16,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:16,766 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-23 14:41:16,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:41:16,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:41:16,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:41:16,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:41:16,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:41:16,770 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-01-23 14:41:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:16,882 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-23 14:41:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:41:16,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-23 14:41:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:16,883 INFO L225 Difference]: With dead ends: 43 [2018-01-23 14:41:16,883 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:41:16,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:41:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:41:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:41:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:41:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:41:16,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-23 14:41:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:16,885 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:41:16,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:41:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:41:16,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:41:16,887 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:41:16,887 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:41:16,887 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:41:16,887 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:41:16,887 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:41:16,887 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:41:16,887 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:41:16,887 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:41:16,887 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:41:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:41:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-23 14:41:16,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,890 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,890 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -851979775, now seen corresponding path program 1 times [2018-01-23 14:41:16,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:16,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:16,904 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-23 14:41:16,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:41:16,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:41:16,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:41:16,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:41:16,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,905 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:41:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:16,912 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-23 14:41:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:41:16,913 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-23 14:41:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:16,914 INFO L225 Difference]: With dead ends: 114 [2018-01-23 14:41:16,914 INFO L226 Difference]: Without dead ends: 57 [2018-01-23 14:41:16,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:41:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-23 14:41:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-23 14:41:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-23 14:41:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-01-23 14:41:16,919 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2018-01-23 14:41:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:16,919 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-01-23 14:41:16,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:41:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-01-23 14:41:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:41:16,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,920 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash -178858898, now seen corresponding path program 1 times [2018-01-23 14:41:16,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:16,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:16,943 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-23 14:41:16,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:41:16,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:41:16,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:41:16,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:41:16,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:41:16,945 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-01-23 14:41:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:16,973 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-01-23 14:41:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:41:16,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-23 14:41:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:16,976 INFO L225 Difference]: With dead ends: 76 [2018-01-23 14:41:16,976 INFO L226 Difference]: Without dead ends: 61 [2018-01-23 14:41:16,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:41:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-23 14:41:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-23 14:41:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:41:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-23 14:41:16,988 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-01-23 14:41:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:16,988 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-23 14:41:16,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:41:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-23 14:41:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:41:16,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:16,989 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:16,989 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -853032378, now seen corresponding path program 1 times [2018-01-23 14:41:16,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:16,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:16,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:16,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:16,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:17,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:41:17,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:17,061 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-23 14:41:17,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:17,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:41:17,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:17,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-23 14:41:17,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:41:17,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:41:17,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:41:17,179 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-23 14:41:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:17,244 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-23 14:41:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:41:17,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-23 14:41:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:17,246 INFO L225 Difference]: With dead ends: 80 [2018-01-23 14:41:17,247 INFO L226 Difference]: Without dead ends: 68 [2018-01-23 14:41:17,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:41:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-23 14:41:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-01-23 14:41:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-23 14:41:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-23 14:41:17,255 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 46 [2018-01-23 14:41:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:17,256 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-23 14:41:17,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:41:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-23 14:41:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-23 14:41:17,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:17,260 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:17,260 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash -723838693, now seen corresponding path program 2 times [2018-01-23 14:41:17,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:17,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:17,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:17,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:17,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:17,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-23 14:41:17,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:17,375 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-23 14:41:17,385 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:41:17,405 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:17,421 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:17,423 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:17,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:41:17,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:41:17,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-23 14:41:17,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:41:17,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:41:17,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:41:17,499 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 10 states. [2018-01-23 14:41:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:17,915 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2018-01-23 14:41:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:41:17,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-01-23 14:41:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:17,919 INFO L225 Difference]: With dead ends: 160 [2018-01-23 14:41:17,919 INFO L226 Difference]: Without dead ends: 114 [2018-01-23 14:41:17,919 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:41:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-23 14:41:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2018-01-23 14:41:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-23 14:41:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-01-23 14:41:17,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 71 [2018-01-23 14:41:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:17,928 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-01-23 14:41:17,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:41:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-01-23 14:41:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-23 14:41:17,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:17,932 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-23 14:41:17,932 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash 830349990, now seen corresponding path program 1 times [2018-01-23 14:41:17,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:17,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:17,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:17,933 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:17,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:17,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-23 14:41:18,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:18,102 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-23 14:41:18,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:18,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:41:18,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:41:18,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-01-23 14:41:18,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:41:18,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:41:18,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:41:18,294 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 12 states. [2018-01-23 14:41:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:18,590 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-01-23 14:41:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:41:18,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-01-23 14:41:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:18,592 INFO L225 Difference]: With dead ends: 190 [2018-01-23 14:41:18,592 INFO L226 Difference]: Without dead ends: 110 [2018-01-23 14:41:18,594 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:41:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-23 14:41:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-01-23 14:41:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-23 14:41:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-01-23 14:41:18,604 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 108 [2018-01-23 14:41:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:18,605 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-01-23 14:41:18,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:41:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-01-23 14:41:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-23 14:41:18,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:18,607 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:18,608 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1031334774, now seen corresponding path program 1 times [2018-01-23 14:41:18,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:18,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:18,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:18,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:18,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:18,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-01-23 14:41:18,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:18,826 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-23 14:41:18,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:18,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 174 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-01-23 14:41:19,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:19,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-01-23 14:41:19,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-23 14:41:19,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-23 14:41:19,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:41:19,069 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 14 states. [2018-01-23 14:41:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:19,368 INFO L93 Difference]: Finished difference Result 252 states and 287 transitions. [2018-01-23 14:41:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:41:19,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 154 [2018-01-23 14:41:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:19,370 INFO L225 Difference]: With dead ends: 252 [2018-01-23 14:41:19,370 INFO L226 Difference]: Without dead ends: 193 [2018-01-23 14:41:19,371 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:41:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-23 14:41:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2018-01-23 14:41:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-23 14:41:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-01-23 14:41:19,386 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 154 [2018-01-23 14:41:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:19,387 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-01-23 14:41:19,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-23 14:41:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-01-23 14:41:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-23 14:41:19,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:19,389 INFO L322 BasicCegarLoop]: trace histogram [12, 9, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:19,389 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1652402302, now seen corresponding path program 2 times [2018-01-23 14:41:19,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:19,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:19,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:19,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:19,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:19,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-23 14:41:19,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:19,631 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-23 14:41:19,639 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:41:19,663 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:19,701 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:19,710 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:19,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-23 14:41:19,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:19,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-01-23 14:41:19,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:41:19,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:41:19,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:41:19,852 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 16 states. [2018-01-23 14:41:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:20,167 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2018-01-23 14:41:20,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-23 14:41:20,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 208 [2018-01-23 14:41:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:20,170 INFO L225 Difference]: With dead ends: 256 [2018-01-23 14:41:20,170 INFO L226 Difference]: Without dead ends: 158 [2018-01-23 14:41:20,171 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:41:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-23 14:41:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-01-23 14:41:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:41:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-01-23 14:41:20,182 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 208 [2018-01-23 14:41:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:20,183 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-01-23 14:41:20,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:41:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-01-23 14:41:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-23 14:41:20,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:20,187 INFO L322 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:20,187 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1533664142, now seen corresponding path program 3 times [2018-01-23 14:41:20,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:20,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:20,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:20,189 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:20,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:20,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-01-23 14:41:20,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:20,463 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-23 14:41:20,470 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:41:20,493 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:20,500 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:20,514 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:20,533 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:20,546 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:20,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 205 proven. 10 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-01-23 14:41:20,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:20,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-23 14:41:20,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-23 14:41:20,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-23 14:41:20,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:41:20,676 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 14 states. [2018-01-23 14:41:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:20,932 INFO L93 Difference]: Finished difference Result 347 states and 409 transitions. [2018-01-23 14:41:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-23 14:41:20,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 270 [2018-01-23 14:41:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:20,937 INFO L225 Difference]: With dead ends: 347 [2018-01-23 14:41:20,938 INFO L226 Difference]: Without dead ends: 335 [2018-01-23 14:41:20,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:41:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-23 14:41:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 204. [2018-01-23 14:41:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-23 14:41:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2018-01-23 14:41:20,961 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 270 [2018-01-23 14:41:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:20,962 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2018-01-23 14:41:20,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-23 14:41:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2018-01-23 14:41:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-01-23 14:41:20,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:20,969 INFO L322 BasicCegarLoop]: trace histogram [22, 18, 15, 15, 15, 15, 15, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:20,969 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1619197343, now seen corresponding path program 4 times [2018-01-23 14:41:20,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:20,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:20,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:20,970 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:20,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:21,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1647 trivial. 0 not checked. [2018-01-23 14:41:21,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:21,385 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-23 14:41:21,390 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:41:21,462 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:21,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 1172 proven. 9 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-01-23 14:41:21,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:21,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-01-23 14:41:21,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:41:21,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:41:21,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:41:21,717 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand 20 states. [2018-01-23 14:41:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:22,072 INFO L93 Difference]: Finished difference Result 465 states and 577 transitions. [2018-01-23 14:41:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-23 14:41:22,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 341 [2018-01-23 14:41:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:22,076 INFO L225 Difference]: With dead ends: 465 [2018-01-23 14:41:22,076 INFO L226 Difference]: Without dead ends: 348 [2018-01-23 14:41:22,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-01-23 14:41:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-23 14:41:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 213. [2018-01-23 14:41:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-23 14:41:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-01-23 14:41:22,095 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 341 [2018-01-23 14:41:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:22,096 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-01-23 14:41:22,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:41:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-01-23 14:41:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-01-23 14:41:22,098 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:22,099 INFO L322 BasicCegarLoop]: trace histogram [26, 25, 18, 18, 18, 18, 17, 17, 17, 17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:22,099 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1303612877, now seen corresponding path program 5 times [2018-01-23 14:41:22,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:22,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:22,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:22,100 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:22,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:22,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2857 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2018-01-23 14:41:22,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:22,610 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:22,616 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:41:22,646 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,652 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,660 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,667 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,725 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:22,728 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:22,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2857 backedges. 1502 proven. 70 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2018-01-23 14:41:22,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:22,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-23 14:41:22,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:41:22,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:41:22,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:41:22,925 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 22 states. [2018-01-23 14:41:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:23,607 INFO L93 Difference]: Finished difference Result 454 states and 532 transitions. [2018-01-23 14:41:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:41:23,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 413 [2018-01-23 14:41:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:23,610 INFO L225 Difference]: With dead ends: 454 [2018-01-23 14:41:23,610 INFO L226 Difference]: Without dead ends: 231 [2018-01-23 14:41:23,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2018-01-23 14:41:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-01-23 14:41:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2018-01-23 14:41:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-23 14:41:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2018-01-23 14:41:23,627 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 413 [2018-01-23 14:41:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:23,627 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2018-01-23 14:41:23,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:41:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2018-01-23 14:41:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-01-23 14:41:23,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:23,630 INFO L322 BasicCegarLoop]: trace histogram [30, 30, 21, 21, 21, 21, 21, 21, 21, 21, 21, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:23,630 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:23,630 INFO L82 PathProgramCache]: Analyzing trace with hash -532121145, now seen corresponding path program 6 times [2018-01-23 14:41:23,630 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:23,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:23,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:23,631 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:23,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:23,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3984 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 3714 trivial. 0 not checked. [2018-01-23 14:41:24,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:24,153 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:24,159 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-23 14:41:24,203 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,206 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,215 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,228 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,290 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,385 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,733 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:41:24,738 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:24,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:24,768 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-23 14:41:24,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:24,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:24,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:41:24,868 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 15 treesize of output 12 [2018-01-23 14:41:24,870 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 12 treesize of output 11 [2018-01-23 14:41:24,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:24,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:24,883 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-23 14:41:24,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-23 14:41:25,082 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 15 treesize of output 28 [2018-01-23 14:41:25,087 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 17 treesize of output 16 [2018-01-23 14:41:25,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,104 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-23 14:41:25,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-23 14:41:25,343 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-23 14:41:25,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:41:25,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-01-23 14:41:25,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-01-23 14:41:25,445 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 12 treesize of output 11 [2018-01-23 14:41:25,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:41:25,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-01-23 14:41:25,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-23 14:41:25,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 35 [2018-01-23 14:41:25,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:41:25,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-01-23 14:41:25,828 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 31 treesize of output 41 [2018-01-23 14:41:25,830 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 32 treesize of output 34 [2018-01-23 14:41:25,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-23 14:41:25,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-01-23 14:41:25,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,900 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 47 [2018-01-23 14:41:25,901 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:25,917 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:25,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:25,935 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-01-23 14:41:25,936 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 21 treesize of output 24 [2018-01-23 14:41:25,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-23 14:41:25,940 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,943 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-23 14:41:25,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,956 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 15 treesize of output 22 [2018-01-23 14:41:25,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:25,961 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 18 treesize of output 31 [2018-01-23 14:41:25,961 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,967 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,972 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:25,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-23 14:41:25,996 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:37 [2018-01-23 14:41:26,303 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-23 14:41:26,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:26,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:41:26,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-23 14:41:26,318 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= (select |c_#valid| |foo_~#a~3.base|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse0 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse0 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse0) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (= (let ((.cse1 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse1 4) (select .cse1 0))) 0))) is different from true [2018-01-23 14:41:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3984 backedges. 1377 proven. 67 refuted. 0 times theorem prover too weak. 2538 trivial. 2 not checked. [2018-01-23 14:41:26,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:26,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 38] total 48 [2018-01-23 14:41:26,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-23 14:41:26,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-23 14:41:26,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1971, Unknown=1, NotChecked=90, Total=2256 [2018-01-23 14:41:26,631 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand 48 states. [2018-01-23 14:41:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:29,632 INFO L93 Difference]: Finished difference Result 413 states and 467 transitions. [2018-01-23 14:41:29,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-23 14:41:29,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 477 [2018-01-23 14:41:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:29,636 INFO L225 Difference]: With dead ends: 413 [2018-01-23 14:41:29,636 INFO L226 Difference]: Without dead ends: 291 [2018-01-23 14:41:29,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=521, Invalid=5485, Unknown=4, NotChecked=152, Total=6162 [2018-01-23 14:41:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-23 14:41:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 247. [2018-01-23 14:41:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-23 14:41:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 281 transitions. [2018-01-23 14:41:29,664 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 281 transitions. Word has length 477 [2018-01-23 14:41:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:29,664 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 281 transitions. [2018-01-23 14:41:29,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-23 14:41:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 281 transitions. [2018-01-23 14:41:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-01-23 14:41:29,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:29,668 INFO L322 BasicCegarLoop]: trace histogram [34, 34, 24, 24, 24, 24, 24, 24, 24, 24, 24, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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-23 14:41:29,669 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:29,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1036125280, now seen corresponding path program 1 times [2018-01-23 14:41:29,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:29,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:29,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:29,670 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:29,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:29,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2018-01-23 14:41:30,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:30,319 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:30,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:30,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 2826 proven. 24 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2018-01-23 14:41:31,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:31,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-23 14:41:31,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-23 14:41:31,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-23 14:41:31,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:41:31,282 INFO L87 Difference]: Start difference. First operand 247 states and 281 transitions. Second operand 24 states. [2018-01-23 14:41:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:32,144 INFO L93 Difference]: Finished difference Result 504 states and 581 transitions. [2018-01-23 14:41:32,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:41:32,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 535 [2018-01-23 14:41:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:32,148 INFO L225 Difference]: With dead ends: 504 [2018-01-23 14:41:32,148 INFO L226 Difference]: Without dead ends: 389 [2018-01-23 14:41:32,149 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:41:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-23 14:41:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 292. [2018-01-23 14:41:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-23 14:41:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 330 transitions. [2018-01-23 14:41:32,183 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 330 transitions. Word has length 535 [2018-01-23 14:41:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:32,184 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 330 transitions. [2018-01-23 14:41:32,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-23 14:41:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 330 transitions. [2018-01-23 14:41:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-01-23 14:41:32,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:32,190 INFO L322 BasicCegarLoop]: trace histogram [45, 38, 34, 34, 34, 34, 34, 27, 27, 27, 27, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 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-23 14:41:32,190 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1422391620, now seen corresponding path program 2 times [2018-01-23 14:41:32,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:32,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:32,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:32,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:32,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:32,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 7433 trivial. 0 not checked. [2018-01-23 14:41:33,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:33,091 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:33,098 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:41:33,140 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:33,241 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:33,256 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:33,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 4068 proven. 21 refuted. 0 times theorem prover too weak. 3751 trivial. 0 not checked. [2018-01-23 14:41:33,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:33,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-23 14:41:33,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-23 14:41:33,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-23 14:41:33,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-01-23 14:41:33,871 INFO L87 Difference]: Start difference. First operand 292 states and 330 transitions. Second operand 26 states. [2018-01-23 14:41:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:34,766 INFO L93 Difference]: Finished difference Result 469 states and 539 transitions. [2018-01-23 14:41:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:41:34,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 635 [2018-01-23 14:41:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:34,769 INFO L225 Difference]: With dead ends: 469 [2018-01-23 14:41:34,769 INFO L226 Difference]: Without dead ends: 315 [2018-01-23 14:41:34,771 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2018-01-23 14:41:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-23 14:41:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2018-01-23 14:41:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-01-23 14:41:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 351 transitions. [2018-01-23 14:41:34,802 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 351 transitions. Word has length 635 [2018-01-23 14:41:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:34,803 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 351 transitions. [2018-01-23 14:41:34,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-23 14:41:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 351 transitions. [2018-01-23 14:41:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-01-23 14:41:34,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:34,807 INFO L322 BasicCegarLoop]: trace histogram [50, 50, 38, 38, 38, 38, 38, 38, 38, 38, 38, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 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-23 14:41:34,808 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2002889800, now seen corresponding path program 3 times [2018-01-23 14:41:34,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:34,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:34,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:34,809 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:34,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:34,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11209 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 10723 trivial. 0 not checked. [2018-01-23 14:41:35,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:35,779 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:35,786 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:41:35,829 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,835 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,843 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,852 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,882 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,928 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:41:35,931 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:35,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11209 backedges. 2034 proven. 44 refuted. 0 times theorem prover too weak. 9131 trivial. 0 not checked. [2018-01-23 14:41:36,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:36,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-23 14:41:36,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-23 14:41:36,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-23 14:41:36,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2018-01-23 14:41:36,358 INFO L87 Difference]: Start difference. First operand 307 states and 351 transitions. Second operand 27 states. [2018-01-23 14:41:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:37,485 INFO L93 Difference]: Finished difference Result 700 states and 849 transitions. [2018-01-23 14:41:37,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:41:37,486 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 739 [2018-01-23 14:41:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:37,493 INFO L225 Difference]: With dead ends: 700 [2018-01-23 14:41:37,493 INFO L226 Difference]: Without dead ends: 688 [2018-01-23 14:41:37,494 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:41:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-01-23 14:41:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 358. [2018-01-23 14:41:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-23 14:41:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 414 transitions. [2018-01-23 14:41:37,542 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 414 transitions. Word has length 739 [2018-01-23 14:41:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:37,543 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 414 transitions. [2018-01-23 14:41:37,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-23 14:41:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 414 transitions. [2018-01-23 14:41:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-01-23 14:41:37,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:37,552 INFO L322 BasicCegarLoop]: trace histogram [63, 55, 50, 50, 50, 50, 50, 42, 42, 42, 42, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 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-23 14:41:37,552 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 270789449, now seen corresponding path program 4 times [2018-01-23 14:41:37,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:37,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:37,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:37,553 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:37,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:37,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15999 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 15427 trivial. 0 not checked. [2018-01-23 14:41:38,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:38,641 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:38,647 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:41:38,832 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:38,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15999 backedges. 8105 proven. 38 refuted. 0 times theorem prover too weak. 7856 trivial. 0 not checked. [2018-01-23 14:41:39,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:39,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-01-23 14:41:39,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:41:39,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:41:39,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-01-23 14:41:39,535 INFO L87 Difference]: Start difference. First operand 358 states and 414 transitions. Second operand 30 states. [2018-01-23 14:41:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:40,341 INFO L93 Difference]: Finished difference Result 901 states and 1181 transitions. [2018-01-23 14:41:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-23 14:41:40,342 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 856 [2018-01-23 14:41:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:40,348 INFO L225 Difference]: With dead ends: 901 [2018-01-23 14:41:40,348 INFO L226 Difference]: Without dead ends: 728 [2018-01-23 14:41:40,352 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=439, Invalid=1913, Unknown=0, NotChecked=0, Total=2352 [2018-01-23 14:41:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-01-23 14:41:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 382. [2018-01-23 14:41:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-23 14:41:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 449 transitions. [2018-01-23 14:41:40,407 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 449 transitions. Word has length 856 [2018-01-23 14:41:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:40,408 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 449 transitions. [2018-01-23 14:41:40,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:41:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 449 transitions. [2018-01-23 14:41:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2018-01-23 14:41:40,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:40,419 INFO L322 BasicCegarLoop]: trace histogram [69, 68, 55, 55, 55, 55, 54, 54, 54, 54, 54, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 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-23 14:41:40,419 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1393414499, now seen corresponding path program 5 times [2018-01-23 14:41:40,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:40,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:40,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:40,420 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:40,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:40,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21340 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 20675 trivial. 0 not checked. [2018-01-23 14:41:41,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:41,894 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:41,900 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:41:41,951 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:41,962 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:42,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:42,268 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:42,705 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:41:42,731 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:41:42,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:42,772 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 15 treesize of output 12 [2018-01-23 14:41:42,780 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 12 treesize of output 11 [2018-01-23 14:41:42,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:42,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:42,782 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-23 14:41:42,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:1 [2018-01-23 14:41:43,051 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 15 treesize of output 28 [2018-01-23 14:41:43,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-23 14:41:43,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,072 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 12 treesize of output 11 [2018-01-23 14:41:43,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,079 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-23 14:41:43,079 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-23 14:41:43,220 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 15 treesize of output 28 [2018-01-23 14:41:43,222 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 17 treesize of output 16 [2018-01-23 14:41:43,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:41:43,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-23 14:41:43,270 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 35 treesize of output 43 [2018-01-23 14:41:43,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-01-23 14:41:43,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,300 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 2 case distinctions, treesize of input 29 treesize of output 49 [2018-01-23 14:41:43,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:43,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:43,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:41:43,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:71 [2018-01-23 14:41:43,717 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 31 treesize of output 41 [2018-01-23 14:41:43,719 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 32 treesize of output 34 [2018-01-23 14:41:43,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-23 14:41:43,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,748 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-01-23 14:41:43,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,760 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 47 [2018-01-23 14:41:43,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:43,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:43,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:43,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-01-23 14:41:43,794 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 21 treesize of output 24 [2018-01-23 14:41:43,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-23 14:41:43,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-23 14:41:43,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 22 [2018-01-23 14:41:43,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:43,810 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 18 treesize of output 31 [2018-01-23 14:41:43,811 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,815 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,819 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:43,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-23 14:41:43,834 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:37 [2018-01-23 14:41:44,311 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 84 DAG size of output 69 [2018-01-23 14:41:44,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 91 [2018-01-23 14:41:44,321 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 44 treesize of output 39 [2018-01-23 14:41:44,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2018-01-23 14:41:44,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,405 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 76 treesize of output 88 [2018-01-23 14:41:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-01-23 14:41:44,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-01-23 14:41:44,412 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,460 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 73 treesize of output 75 [2018-01-23 14:41:44,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-01-23 14:41:44,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,474 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,521 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 78 treesize of output 99 [2018-01-23 14:41:44,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,530 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:44,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,532 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 74 treesize of output 130 [2018-01-23 14:41:44,551 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 2 case distinctions, treesize of input 61 treesize of output 78 [2018-01-23 14:41:44,552 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:44,593 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:44,725 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 75 treesize of output 77 [2018-01-23 14:41:44,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-01-23 14:41:44,728 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,740 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:44,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,804 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:44,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:44,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 114 [2018-01-23 14:41:44,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2018-01-23 14:41:44,820 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:44,850 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:44,927 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:44,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-23 14:41:44,975 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:181, output treesize:205 [2018-01-23 14:41:45,114 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 76 treesize of output 76 [2018-01-23 14:41:45,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,120 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:45,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,125 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 71 treesize of output 163 [2018-01-23 14:41:45,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:45,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,181 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:45,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 180 [2018-01-23 14:41:45,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:41:45,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:41:45,312 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 68 treesize of output 51 [2018-01-23 14:41:45,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,325 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 45 treesize of output 163 [2018-01-23 14:41:45,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:45,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:45,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:41:45,380 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:145, output treesize:168 [2018-01-23 14:41:45,961 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 49 DAG size of output 42 [2018-01-23 14:41:45,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-01-23 14:41:45,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,976 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 49 treesize of output 61 [2018-01-23 14:41:45,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:45,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-01-23 14:41:45,996 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:41:45,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:45,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:45,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,014 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 71 [2018-01-23 14:41:46,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,018 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:46,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2018-01-23 14:41:46,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 89 [2018-01-23 14:41:46,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-23 14:41:46,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:41:46,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:41:46,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:41:46,170 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-01-23 14:41:46,171 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 30 treesize of output 33 [2018-01-23 14:41:46,174 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 33 treesize of output 35 [2018-01-23 14:41:46,182 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 38 [2018-01-23 14:41:46,183 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,187 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,192 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,199 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2018-01-23 14:41:46,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-01-23 14:41:46,209 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-01-23 14:41:46,234 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:41:46,234 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,238 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:41:46,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-01-23 14:41:46,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:41:46,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-01-23 14:41:46,248 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,257 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,262 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,268 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-23 14:41:46,297 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:78, output treesize:111 [2018-01-23 14:41:46,653 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= |c_foo_#t~ret5| (let ((.cse0 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse0 4) (select .cse0 8) (select .cse0 0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse1 (let ((.cse2 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse2 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse2) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (store .cse1 8 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))))) is different from true [2018-01-23 14:41:46,657 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= 0 (let ((.cse0 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse0 4) (select .cse0 8) (select .cse0 0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse1 (let ((.cse2 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse2 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse2) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (store .cse1 8 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))))) is different from true [2018-01-23 14:41:46,679 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-23 14:41:46,679 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:747, output treesize:1 [2018-01-23 14:41:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 21340 backedges. 5284 proven. 236 refuted. 0 times theorem prover too weak. 15810 trivial. 10 not checked. [2018-01-23 14:41:47,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:47,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 52] total 67 [2018-01-23 14:41:47,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-01-23 14:41:47,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-01-23 14:41:47,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3829, Unknown=2, NotChecked=254, Total=4422 [2018-01-23 14:41:47,555 INFO L87 Difference]: Start difference. First operand 382 states and 449 transitions. Second operand 67 states. [2018-01-23 14:41:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:52,324 INFO L93 Difference]: Finished difference Result 1071 states and 1292 transitions. [2018-01-23 14:41:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-01-23 14:41:52,325 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 970 [2018-01-23 14:41:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:52,330 INFO L225 Difference]: With dead ends: 1071 [2018-01-23 14:41:52,330 INFO L226 Difference]: Without dead ends: 846 [2018-01-23 14:41:52,335 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 918 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=528, Invalid=7850, Unknown=2, NotChecked=362, Total=8742 [2018-01-23 14:41:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-01-23 14:41:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 420. [2018-01-23 14:41:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-01-23 14:41:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 497 transitions. [2018-01-23 14:41:52,410 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 497 transitions. Word has length 970 [2018-01-23 14:41:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:52,411 INFO L432 AbstractCegarLoop]: Abstraction has 420 states and 497 transitions. [2018-01-23 14:41:52,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-01-23 14:41:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 497 transitions. [2018-01-23 14:41:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2018-01-23 14:41:52,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:52,423 INFO L322 BasicCegarLoop]: trace histogram [76, 73, 61, 61, 61, 61, 58, 58, 58, 58, 58, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:52,423 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -760958465, now seen corresponding path program 7 times [2018-01-23 14:41:52,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:52,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:52,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:52,425 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:41:52,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:52,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:41:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25293 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 24528 trivial. 0 not checked. [2018-01-23 14:41:54,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:41:54,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:41:54,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:54,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:41:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25293 backedges. 2104 proven. 10 refuted. 0 times theorem prover too weak. 23179 trivial. 0 not checked. [2018-01-23 14:41:54,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:41:54,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 24 [2018-01-23 14:41:54,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-23 14:41:54,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-23 14:41:54,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:41:54,879 INFO L87 Difference]: Start difference. First operand 420 states and 497 transitions. Second operand 24 states. [2018-01-23 14:41:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:41:55,248 INFO L93 Difference]: Finished difference Result 1181 states and 1419 transitions. [2018-01-23 14:41:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:41:55,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1049 [2018-01-23 14:41:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:41:55,251 INFO L225 Difference]: With dead ends: 1181 [2018-01-23 14:41:55,251 INFO L226 Difference]: Without dead ends: 770 [2018-01-23 14:41:55,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2018-01-23 14:41:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-01-23 14:41:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 427. [2018-01-23 14:41:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-01-23 14:41:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 494 transitions. [2018-01-23 14:41:55,336 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 494 transitions. Word has length 1049 [2018-01-23 14:41:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:41:55,337 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 494 transitions. [2018-01-23 14:41:55,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-23 14:41:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 494 transitions. [2018-01-23 14:41:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2018-01-23 14:41:55,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:41:55,351 INFO L322 BasicCegarLoop]: trace histogram [81, 78, 65, 65, 65, 65, 62, 62, 62, 62, 62, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:41:55,351 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:41:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 666200866, now seen corresponding path program 6 times [2018-01-23 14:41:55,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:41:55,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:41:55,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:55,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:41:55,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:41:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:41:55,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-23 14:41:56,703 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:41:56,705 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:41:56,705 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:41:56,706 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:41:56,706 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:41:56,706 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:41:56,706 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:41:56,706 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:41:56,706 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:41:56,706 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:41:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:41:56,707 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:41:56,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:41:56 BoogieIcfgContainer [2018-01-23 14:41:56,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:41:56,709 INFO L168 Benchmark]: Toolchain (without parser) took 41175.20 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 268.1 MB in the beginning and 321.4 MB in the end (delta: -53.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-23 14:41:56,711 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:41:56,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.12 ms. Allocated memory is still 307.2 MB. Free memory was 268.1 MB in the beginning and 258.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:41:56,711 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 307.2 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:41:56,712 INFO L168 Benchmark]: RCFGBuilder took 263.74 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 239.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:41:56,712 INFO L168 Benchmark]: TraceAbstraction took 40693.26 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 237.2 MB in the beginning and 321.4 MB in the end (delta: -84.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-23 14:41:56,714 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.13 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.12 ms. Allocated memory is still 307.2 MB. Free memory was 268.1 MB in the beginning and 258.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.08 ms. Allocated memory is still 307.2 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.74 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 239.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40693.26 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 237.2 MB in the beginning and 321.4 MB in the end (delta: -84.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: barErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 12 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: fooErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 18 SDslu, 26 SDs, 0 SdLazy, 36 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 3460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was analyzing trace of length 1119 with TraceHistMax 81, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 39.8s OverallTime, 18 OverallIterations, 81 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 965 SDtfs, 2677 SDslu, 10585 SDs, 0 SdLazy, 13480 SolverSat, 700 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7226 GetRequests, 6710 SyntacticMatches, 5 SemanticMatches, 511 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6157 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=17, 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, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 1992 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 13780 NumberOfCodeBlocks, 12025 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 13748 ConstructedInterpolants, 45 QuantifiedInterpolants, 17385303 SizeOfPredicates, 121 NumberOfNonLiveVariables, 11489 ConjunctsInSsa, 444 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 189987/194694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while IsEmpty was searching accepting run (input had 62 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-41-56-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-41-56-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-41-56-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-41-56-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-41-56-724.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-41-56-724.csv Completed graceful shutdown