java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:46:32,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:46:32,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:46:32,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:46:32,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:46:32,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:46:32,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:46:32,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:46:32,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:46:32,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:46:32,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:46:32,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:46:32,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:46:32,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:46:32,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:46:32,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:46:32,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:46:32,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:46:32,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:46:32,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:46:32,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:46:32,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:46:32,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:46:32,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:46:32,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:46:32,594 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:46:32,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:46:32,595 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:46:32,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:46:32,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:46:32,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:46:32,596 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:46:32,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:46:32,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:46:32,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:46:32,605 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:46:32,605 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:46:32,605 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:46:32,605 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:46:32,605 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:46:32,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:46:32,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:46:32,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:46:32,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:46:32,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:46:32,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:46:32,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:46:32,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:46:32,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:46:32,608 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:46:32,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:46:32,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:46:32,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:46:32,608 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:46:32,609 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:46:32,610 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:46:32,610 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:46:32,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:46:32,653 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:46:32,656 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:46:32,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:46:32,657 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:46:32,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:46:32,810 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:46:32,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:46:32,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:46:32,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:46:32,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:46:32,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:46:32" (1/1) ... [2018-01-24 16:46:32,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4545185a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:32, skipping insertion in model container [2018-01-24 16:46:32,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:46:32" (1/1) ... [2018-01-24 16:46:32,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:46:32,872 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:46:32,991 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:46:33,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:46:33,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33 WrapperNode [2018-01-24 16:46:33,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:46:33,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:46:33,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:46:33,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:46:33,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... [2018-01-24 16:46:33,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:46:33,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:46:33,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:46:33,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:46:33,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:46:33,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:46:33,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:46:33,116 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-01-24 16:46:33,116 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:46:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:46:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:46:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:46:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-01-24 16:46:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:46:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:46:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:46:33,449 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:46:33,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:46:33 BoogieIcfgContainer [2018-01-24 16:46:33,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:46:33,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:46:33,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:46:33,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:46:33,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:46:32" (1/3) ... [2018-01-24 16:46:33,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df8ccdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:46:33, skipping insertion in model container [2018-01-24 16:46:33,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:33" (2/3) ... [2018-01-24 16:46:33,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df8ccdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:46:33, skipping insertion in model container [2018-01-24 16:46:33,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:46:33" (3/3) ... [2018-01-24 16:46:33,457 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:46:33,465 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:46:33,471 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 16:46:33,507 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:46:33,508 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:46:33,508 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:46:33,508 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:46:33,508 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:46:33,508 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:46:33,508 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:46:33,508 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:46:33,509 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:46:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-01-24 16:46:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:46:33,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:33,531 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:33,531 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 149116887, now seen corresponding path program 1 times [2018-01-24 16:46:33,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:33,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:33,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:33,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:33,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:33,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:33,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:33,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:46:33,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:33,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:46:33,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:46:33,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:46:33,731 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-01-24 16:46:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:33,953 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-24 16:46:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:46:33,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:46:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:33,965 INFO L225 Difference]: With dead ends: 89 [2018-01-24 16:46:33,965 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:46:33,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:46:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 16:46:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 16:46:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 16:46:33,996 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13 [2018-01-24 16:46:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:33,996 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 16:46:33,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:46:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 16:46:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:46:33,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:33,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:33,997 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash 149116888, now seen corresponding path program 1 times [2018-01-24 16:46:33,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:33,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:33,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:33,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:33,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:34,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:34,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:34,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:46:34,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:34,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:46:34,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:46:34,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:34,131 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 5 states. [2018-01-24 16:46:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:34,213 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-24 16:46:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:46:34,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 16:46:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:34,215 INFO L225 Difference]: With dead ends: 67 [2018-01-24 16:46:34,215 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:46:34,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:46:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-24 16:46:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 16:46:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-24 16:46:34,224 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 13 [2018-01-24 16:46:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:34,224 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-24 16:46:34,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:46:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-24 16:46:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:46:34,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:34,225 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:34,226 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074556, now seen corresponding path program 1 times [2018-01-24 16:46:34,226 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:34,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:34,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:34,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:34,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:34,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:46:34,283 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:34,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:46:34,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:46:34,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:46:34,284 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2018-01-24 16:46:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:34,329 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-24 16:46:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:46:34,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 16:46:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:34,331 INFO L225 Difference]: With dead ends: 66 [2018-01-24 16:46:34,331 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 16:46:34,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:46:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 16:46:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 16:46:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 16:46:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 16:46:34,338 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2018-01-24 16:46:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:34,338 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 16:46:34,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:46:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 16:46:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:46:34,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:34,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:34,339 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074557, now seen corresponding path program 1 times [2018-01-24 16:46:34,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:34,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:34,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:34,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:34,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:34,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:46:34,398 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:34,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:46:34,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:46:34,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:46:34,399 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 3 states. [2018-01-24 16:46:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:34,429 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-01-24 16:46:34,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:46:34,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 16:46:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:34,431 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:46:34,431 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:46:34,431 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:46:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:46:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 16:46:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:46:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 16:46:34,437 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2018-01-24 16:46:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:34,438 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 16:46:34,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:46:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 16:46:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:46:34,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:34,439 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] [2018-01-24 16:46:34,439 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018923, now seen corresponding path program 1 times [2018-01-24 16:46:34,439 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:34,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:34,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:34,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:34,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:34,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:46:34,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:34,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:46:34,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:46:34,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:46:34,686 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2018-01-24 16:46:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:34,823 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-01-24 16:46:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:46:34,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-24 16:46:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:34,824 INFO L225 Difference]: With dead ends: 57 [2018-01-24 16:46:34,824 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 16:46:34,825 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:46:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 16:46:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 16:46:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:46:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 16:46:34,831 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2018-01-24 16:46:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:34,832 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 16:46:34,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:46:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 16:46:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:46:34,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:34,833 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] [2018-01-24 16:46:34,833 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018922, now seen corresponding path program 1 times [2018-01-24 16:46:34,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:34,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:34,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:34,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:34,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:35,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:35,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:46:35,084 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:35,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:46:35,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:46:35,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:46:35,085 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-01-24 16:46:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:35,319 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-24 16:46:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:46:35,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-24 16:46:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:35,321 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:46:35,321 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 16:46:35,321 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:46:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 16:46:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 16:46:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:46:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-24 16:46:35,327 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25 [2018-01-24 16:46:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:35,327 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-24 16:46:35,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:46:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-24 16:46:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:46:35,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:35,328 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-24 16:46:35,328 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 684988236, now seen corresponding path program 1 times [2018-01-24 16:46:35,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:35,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:35,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:35,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:35,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:35,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:35,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:35,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:46:35,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:35,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 16:46:35,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 16:46:35,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:46:35,570 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 14 states. [2018-01-24 16:46:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:35,868 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 16:46:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:46:35,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-01-24 16:46:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:35,870 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:46:35,870 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 16:46:35,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-24 16:46:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 16:46:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-24 16:46:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:46:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 16:46:35,875 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2018-01-24 16:46:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:35,876 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 16:46:35,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 16:46:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 16:46:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:46:35,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:35,880 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-24 16:46:35,880 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 684988237, now seen corresponding path program 1 times [2018-01-24 16:46:35,881 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:35,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:35,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:35,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:35,882 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:35,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:36,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:36,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 16:46:36,220 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:36,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:46:36,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:46:36,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:46:36,221 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 13 states. [2018-01-24 16:46:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:36,462 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-01-24 16:46:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:46:36,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-24 16:46:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:36,464 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:46:36,464 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 16:46:36,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:46:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 16:46:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 16:46:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:46:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-24 16:46:36,469 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2018-01-24 16:46:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:36,470 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-24 16:46:36,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:46:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-24 16:46:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:46:36,471 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:36,471 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:36,471 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1786557187, now seen corresponding path program 1 times [2018-01-24 16:46:36,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:36,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:36,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:36,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:36,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:36,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:46:36,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:36,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:46:36,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:46:36,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:36,531 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-01-24 16:46:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:36,570 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-24 16:46:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:46:36,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-24 16:46:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:36,574 INFO L225 Difference]: With dead ends: 86 [2018-01-24 16:46:36,574 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 16:46:36,575 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 16:46:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-01-24 16:46:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 16:46:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-24 16:46:36,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2018-01-24 16:46:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:36,590 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-24 16:46:36,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:46:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-24 16:46:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:46:36,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:36,591 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:36,591 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash -18881147, now seen corresponding path program 1 times [2018-01-24 16:46:36,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:36,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:36,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:36,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:36,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:36,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:46:36,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:36,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:46:36,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:46:36,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:36,682 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-01-24 16:46:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:36,719 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-24 16:46:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:36,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 16:46:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:36,720 INFO L225 Difference]: With dead ends: 79 [2018-01-24 16:46:36,720 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:46:36,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:46:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:46:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-24 16:46:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:46:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-24 16:46:36,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2018-01-24 16:46:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:36,726 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-24 16:46:36,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:46:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-24 16:46:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:46:36,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:36,728 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] [2018-01-24 16:46:36,728 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -25567208, now seen corresponding path program 1 times [2018-01-24 16:46:36,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:36,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:36,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:36,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:36,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:36,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:46:36,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:36,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:46:36,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:46:36,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:36,845 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-01-24 16:46:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:36,915 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-24 16:46:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:36,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 16:46:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:36,917 INFO L225 Difference]: With dead ends: 128 [2018-01-24 16:46:36,917 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 16:46:36,918 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 16:46:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-01-24 16:46:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 16:46:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-24 16:46:36,945 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-01-24 16:46:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:36,945 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-24 16:46:36,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:46:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-24 16:46:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:46:36,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:36,947 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] [2018-01-24 16:46:36,947 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -159580714, now seen corresponding path program 1 times [2018-01-24 16:46:36,947 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:36,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:36,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:36,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:36,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:37,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:37,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:46:37,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:37,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:46:37,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:46:37,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:46:37,128 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 13 states. [2018-01-24 16:46:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:37,411 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-01-24 16:46:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:46:37,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-01-24 16:46:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:37,412 INFO L225 Difference]: With dead ends: 197 [2018-01-24 16:46:37,413 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:46:37,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-24 16:46:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:46:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2018-01-24 16:46:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 16:46:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-01-24 16:46:37,426 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 31 [2018-01-24 16:46:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:37,427 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-01-24 16:46:37,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:46:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-01-24 16:46:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:46:37,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:37,429 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] [2018-01-24 16:46:37,429 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash -19032104, now seen corresponding path program 1 times [2018-01-24 16:46:37,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:37,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:37,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:37,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:37,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:37,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:37,714 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-24 16:46:37,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:37,715 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:37,716 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 16:46:37,717 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [17], [20], [23], [27], [28], [30], [31], [59], [61], [66], [80], [85], [91], [93], [94], [95], [96], [97], [108], [109], [110], [112] [2018-01-24 16:46:37,764 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:46:37,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:46:38,063 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:46:38,065 INFO L268 AbstractInterpreter]: Visited 30 different actions 41 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-24 16:46:38,079 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:46:38,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:38,079 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:46:38,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:38,092 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:38,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:38,196 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 14 treesize of output 11 [2018-01-24 16:46:38,210 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 11 treesize of output 10 [2018-01-24 16:46:38,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,222 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-24 16:46:38,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 16:46:38,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:38,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:38,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:38,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 16:46:38,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:38,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-01-24 16:46:38,437 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 26 treesize of output 27 [2018-01-24 16:46:38,440 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 1 [2018-01-24 16:46:38,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:38,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-01-24 16:46:38,590 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 26 treesize of output 27 [2018-01-24 16:46:38,593 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 1 [2018-01-24 16:46:38,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:38,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:38,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-01-24 16:46:38,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:46:38,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:38,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:38,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:38,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:46:38,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-24 16:46:38,938 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-24 16:46:38,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:39,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:39,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:39,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:39,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-01-24 16:46:39,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:39,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:39,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:39,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:39,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-01-24 16:46:39,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:109 [2018-01-24 16:46:40,119 WARN L146 SmtUtils]: Spent 687ms on a formula simplification. DAG size of input: 61 DAG size of output 23 [2018-01-24 16:46:40,249 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:46:40,250 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:46:40,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-01-24 16:46:40,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:46:40,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:46:40,284 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-24 16:46:40,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:46:40,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:46:40,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,303 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:74, output treesize:7 [2018-01-24 16:46:40,310 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-24 16:46:40,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:40,331 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:40,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:40,334 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:40,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:40,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:40,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:40,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-24 16:46:40,777 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 16 treesize of output 13 [2018-01-24 16:46:40,779 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 13 treesize of output 12 [2018-01-24 16:46:40,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-24 16:46:40,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:40,899 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 23 treesize of output 26 [2018-01-24 16:46:40,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:40,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:40,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:40,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-01-24 16:46:40,962 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 27 treesize of output 28 [2018-01-24 16:46:40,964 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 1 [2018-01-24 16:46:40,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:40,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2018-01-24 16:46:41,049 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 27 treesize of output 28 [2018-01-24 16:46:41,051 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 1 [2018-01-24 16:46:41,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:41,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:41,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-01-24 16:46:41,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:46:41,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:46:41,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:41,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:41,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:46:41,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-24 16:46:41,318 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-24 16:46:41,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:41,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-01-24 16:46:41,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:41,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:41,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:41,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-24 16:46:41,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:100 [2018-01-24 16:46:42,168 WARN L146 SmtUtils]: Spent 442ms on a formula simplification. DAG size of input: 45 DAG size of output 21 [2018-01-24 16:46:42,292 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:46:42,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 12 treesize of output 11 [2018-01-24 16:46:42,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:46:42,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 16:46:42,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:46:42,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:46:42,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:46:42,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 16:46:42,369 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:69 [2018-01-24 16:46:42,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 16:46:42,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:46:42,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 16:46:42,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:42,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:46:42,518 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-24 16:46:42,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:42,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13, 14, 15] total 56 [2018-01-24 16:46:42,520 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:42,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:46:42,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:46:42,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2945, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 16:46:42,521 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 25 states. [2018-01-24 16:46:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:43,851 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-01-24 16:46:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:46:43,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-01-24 16:46:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:43,852 INFO L225 Difference]: With dead ends: 141 [2018-01-24 16:46:43,853 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:46:43,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=395, Invalid=3895, Unknown=0, NotChecked=0, Total=4290 [2018-01-24 16:46:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:46:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-01-24 16:46:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 16:46:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2018-01-24 16:46:43,868 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 31 [2018-01-24 16:46:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:43,868 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2018-01-24 16:46:43,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:46:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2018-01-24 16:46:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:46:43,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:43,870 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:43,870 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885648, now seen corresponding path program 1 times [2018-01-24 16:46:43,870 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:43,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:43,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:43,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:43,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:43,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:43,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:43,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:46:43,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:43,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:46:43,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:46:43,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:43,976 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 5 states. [2018-01-24 16:46:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:44,048 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-01-24 16:46:44,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:44,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 16:46:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:44,049 INFO L225 Difference]: With dead ends: 125 [2018-01-24 16:46:44,049 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 16:46:44,049 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:46:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 16:46:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-24 16:46:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 16:46:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-24 16:46:44,060 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 32 [2018-01-24 16:46:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:44,061 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-24 16:46:44,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:46:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-24 16:46:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:46:44,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:44,062 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:44,062 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885647, now seen corresponding path program 1 times [2018-01-24 16:46:44,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:44,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:44,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:44,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:44,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:44,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:44,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:44,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:46:44,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:44,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:46:44,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:46:44,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:44,152 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 6 states. [2018-01-24 16:46:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:44,222 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2018-01-24 16:46:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:44,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 16:46:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:44,224 INFO L225 Difference]: With dead ends: 188 [2018-01-24 16:46:44,224 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 16:46:44,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 16:46:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2018-01-24 16:46:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:46:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-01-24 16:46:44,240 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 32 [2018-01-24 16:46:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:44,240 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-01-24 16:46:44,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:46:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-01-24 16:46:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:46:44,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:44,241 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:44,242 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1333337037, now seen corresponding path program 1 times [2018-01-24 16:46:44,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:44,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:44,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:44,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:44,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:44,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:44,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:44,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-24 16:46:44,916 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:44,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 16:46:44,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 16:46:44,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-24 16:46:44,917 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 19 states. [2018-01-24 16:46:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:45,589 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-01-24 16:46:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:46:45,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-24 16:46:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:45,626 INFO L225 Difference]: With dead ends: 165 [2018-01-24 16:46:45,626 INFO L226 Difference]: Without dead ends: 164 [2018-01-24 16:46:45,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 16:46:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-24 16:46:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2018-01-24 16:46:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:46:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-01-24 16:46:45,638 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 32 [2018-01-24 16:46:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:45,638 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-01-24 16:46:45,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 16:46:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-01-24 16:46:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:46:45,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:45,639 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:45,639 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1271297423, now seen corresponding path program 1 times [2018-01-24 16:46:45,639 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:45,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:45,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:45,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:45,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:45,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:46,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:46,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 16:46:46,157 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:46,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 16:46:46,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 16:46:46,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:46:46,158 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 18 states. [2018-01-24 16:46:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:46,778 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-01-24 16:46:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:46:46,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-24 16:46:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:46,780 INFO L225 Difference]: With dead ends: 163 [2018-01-24 16:46:46,780 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 16:46:46,781 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-01-24 16:46:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 16:46:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-01-24 16:46:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 16:46:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-01-24 16:46:46,793 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 32 [2018-01-24 16:46:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:46,793 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-01-24 16:46:46,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 16:46:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2018-01-24 16:46:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:46:46,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:46,794 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:46,794 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -589995253, now seen corresponding path program 1 times [2018-01-24 16:46:46,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:46,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:46,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:46,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:46,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:46,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:47,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:47,223 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:47,223 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 16:46:47,223 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [17], [20], [23], [27], [28], [31], [33], [59], [61], [66], [80], [85], [91], [93], [94], [95], [96], [97], [108], [109], [110], [112] [2018-01-24 16:46:47,224 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:46:47,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:46:47,409 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:46:47,409 INFO L268 AbstractInterpreter]: Visited 30 different actions 41 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-24 16:46:47,411 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:46:47,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:47,412 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:46:47,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:47,424 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:47,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:47,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:47,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:47,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:46:47,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:47,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:47,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 16:46:47,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:47,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-24 16:46:47,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:47,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:47,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:47,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:47,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:47,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-24 16:46:47,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:46:47,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:47,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:46:47,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:47,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-24 16:46:47,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-24 16:46:47,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 16:46:47,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:46:47,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:47,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:47,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:47,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-24 16:46:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:48,038 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:49,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:49,616 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:49,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:49,619 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:49,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:49,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:49,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:49,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-24 16:46:49,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:49,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:49,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:49,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:49,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:49,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-01-24 16:46:49,893 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:49,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:49,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:49,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:41 [2018-01-24 16:46:49,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-01-24 16:46:49,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:49,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-01-24 16:46:49,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:49,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:49,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,018 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 40 treesize of output 37 [2018-01-24 16:46:50,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:50,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,046 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 36 treesize of output 33 [2018-01-24 16:46:50,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:50,048 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,055 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:50,070 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:76, output treesize:61 [2018-01-24 16:46:50,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-01-24 16:46:50,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:50,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-01-24 16:46:50,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 16:46:50,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-01-24 16:46:50,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:50,257 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-01-24 16:46:50,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:50,279 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:50,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:46:50,299 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:89, output treesize:38 [2018-01-24 16:46:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:50,873 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:52,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-24 16:46:52,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:52,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-24 16:46:52,298 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 18 treesize of output 24 [2018-01-24 16:46:52,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-01-24 16:46:52,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:52,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:52,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:52,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:52,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:31, output treesize:11 [2018-01-24 16:46:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:52,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:52,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17, 17, 16] total 74 [2018-01-24 16:46:52,413 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:52,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 16:46:52,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 16:46:52,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=5202, Unknown=2, NotChecked=0, Total=5550 [2018-01-24 16:46:52,414 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 35 states. [2018-01-24 16:46:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:54,281 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2018-01-24 16:46:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 16:46:54,281 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2018-01-24 16:46:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:54,282 INFO L225 Difference]: With dead ends: 163 [2018-01-24 16:46:54,283 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 16:46:54,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=742, Invalid=7998, Unknown=2, NotChecked=0, Total=8742 [2018-01-24 16:46:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 16:46:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-01-24 16:46:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:46:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2018-01-24 16:46:54,301 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32 [2018-01-24 16:46:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:54,301 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2018-01-24 16:46:54,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 16:46:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2018-01-24 16:46:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:46:54,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:54,303 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:54,303 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:46:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash 449987274, now seen corresponding path program 1 times [2018-01-24 16:46:54,303 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:54,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:54,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:54,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:54,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:54,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:54,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:54,914 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:54,914 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 16:46:54,914 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [17], [20], [23], [27], [28], [31], [36], [37], [43], [45], [50], [51], [53], [54], [80], [83], [91], [93], [94], [95], [96], [97], [108], [109], [110], [112] [2018-01-24 16:46:54,915 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:46:54,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:46:55,009 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:46:55,010 INFO L268 AbstractInterpreter]: Visited 34 different actions 39 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-01-24 16:46:55,013 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:46:55,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:55,013 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:46:55,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:55,028 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:55,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:55,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:55,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,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 6 treesize of output 5 [2018-01-24 16:46:55,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:46:55,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:55,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 16:46:55,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-24 16:46:55,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,187 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 12 treesize of output 15 [2018-01-24 16:46:55,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:55,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:55,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 16:46:55,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:46:55,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-24 16:46:55,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:46:55,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:55,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-01-24 16:46:55,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-24 16:46:55,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-24 16:46:55,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:46:55,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:55,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:55,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:55,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-01-24 16:46:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:55,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:56,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:56,791 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:56,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:56,795 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:56,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:56,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:56,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:46:56,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:46:56,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:56,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:56,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:56,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:56,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:56,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:56,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:46:57,052 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:57,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:57,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:57,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:35 [2018-01-24 16:46:57,115 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 37 treesize of output 34 [2018-01-24 16:46:57,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:57,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-01-24 16:46:57,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:57,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,164 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 33 treesize of output 30 [2018-01-24 16:46:57,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:57,166 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-01-24 16:46:57,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:46:57,187 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:57,203 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:70, output treesize:55 [2018-01-24 16:46:57,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 16:46:57,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:57,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 16:46:57,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:57,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-24 16:46:57,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:46:57,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-24 16:46:57,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 16:46:57,393 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:57,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:46:57,406 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:83, output treesize:32 [2018-01-24 16:46:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:58,034 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:59,503 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:59,503 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:52, output treesize:1 [2018-01-24 16:46:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:59,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:59,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19, 18, 17] total 79 [2018-01-24 16:46:59,513 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:59,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 16:46:59,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 16:46:59,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=5920, Unknown=0, NotChecked=0, Total=6320 [2018-01-24 16:46:59,515 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 35 states. [2018-01-24 16:47:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:02,820 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2018-01-24 16:47:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-24 16:47:02,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2018-01-24 16:47:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:02,821 INFO L225 Difference]: With dead ends: 219 [2018-01-24 16:47:02,821 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 16:47:02,824 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3520 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1199, Invalid=11911, Unknown=0, NotChecked=0, Total=13110 [2018-01-24 16:47:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 16:47:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-01-24 16:47:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 16:47:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-01-24 16:47:02,837 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 37 [2018-01-24 16:47:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:02,837 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-01-24 16:47:02,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 16:47:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-01-24 16:47:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:47:02,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:02,838 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-01-24 16:47:02,839 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -490194150, now seen corresponding path program 2 times [2018-01-24 16:47:02,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:02,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:02,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:02,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:02,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:02,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:03,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:03,362 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:03,362 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:47:03,362 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:47:03,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:03,362 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:47:03,367 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:03,367 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:03,384 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:03,396 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:03,399 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:03,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:03,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:03,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:47:03,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:03,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:03,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:03,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:03,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:47:03,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:03,477 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 13 treesize of output 12 [2018-01-24 16:47:03,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,485 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-24 16:47:03,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 16:47:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:03,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:03,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:03,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,553 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 19 treesize of output 22 [2018-01-24 16:47:03,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:03,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-01-24 16:47:03,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:47:03,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:03,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,613 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 28 treesize of output 29 [2018-01-24 16:47:03,615 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 1 [2018-01-24 16:47:03,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:03,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-01-24 16:47:03,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:47:03,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-24 16:47:03,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,711 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-24 16:47:03,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-01-24 16:47:03,796 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 28 treesize of output 29 [2018-01-24 16:47:03,797 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 1 [2018-01-24 16:47:03,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:03,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2018-01-24 16:47:03,943 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 24 treesize of output 25 [2018-01-24 16:47:03,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:03,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:03,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:03,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:31 [2018-01-24 16:47:04,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 16:47:04,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 16:47:04,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:04,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:04,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:47:04,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-01-24 16:47:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:04,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:04,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:04,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:04,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:04,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:04,777 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 3 xjuncts. [2018-01-24 16:47:04,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:80 [2018-01-24 16:47:05,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:05,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:05,188 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:05,208 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:05,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-24 16:47:05,237 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:76, output treesize:95 [2018-01-24 16:47:05,550 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:47:05,551 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:47:05,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-01-24 16:47:05,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,576 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:47:05,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:47:05,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-01-24 16:47:05,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-01-24 16:47:05,619 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-24 16:47:05,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-24 16:47:05,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-24 16:47:05,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 16:47:05,653 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:115, output treesize:86 [2018-01-24 16:47:05,835 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:47:05,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:47:05,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 16:47:05,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,848 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:47:05,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:05,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:56, output treesize:6 [2018-01-24 16:47:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:05,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:05,958 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:05,961 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:05,961 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:05,984 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:06,061 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:06,460 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:06,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:06,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:06,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:47:06,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:06,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:06,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:06,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 16:47:06,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-24 16:47:06,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:47:06,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:47:06,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-24 16:47:06,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:06,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:06,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:06,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:06,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 16:47:06,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-01-24 16:47:06,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:47:06,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-24 16:47:06,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 28 [2018-01-24 16:47:06,832 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 1 [2018-01-24 16:47:06,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:37 [2018-01-24 16:47:06,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 16:47:06,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 16:47:06,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:06,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2018-01-24 16:47:07,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 28 [2018-01-24 16:47:07,089 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 1 [2018-01-24 16:47:07,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:07,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:07,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:07,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-01-24 16:47:07,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 24 [2018-01-24 16:47:07,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:07,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:07,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:07,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:07,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:24 [2018-01-24 16:47:07,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 16:47:07,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 16:47:07,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:07,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:07,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:47:07,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-01-24 16:47:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:07,431 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:12,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,649 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 3 xjuncts. [2018-01-24 16:47:12,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:80 [2018-01-24 16:47:12,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,809 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,820 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,828 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:12,865 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,868 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:12,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-24 16:47:12,897 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:76, output treesize:95 [2018-01-24 16:47:13,101 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-01-24 16:47:13,123 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-24 16:47:13,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-24 16:47:13,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-24 16:47:13,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:47:13,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 16:47:13,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:47:13,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-01-24 16:47:13,212 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:87, output treesize:148 [2018-01-24 16:47:13,471 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 27 treesize of output 30 [2018-01-24 16:47:13,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 16:47:13,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:13,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:13,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:111, output treesize:16 [2018-01-24 16:47:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:13,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:47:13,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20, 20, 20] total 73 [2018-01-24 16:47:13,633 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:47:13,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 16:47:13,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 16:47:13,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5152, Unknown=2, NotChecked=0, Total=5402 [2018-01-24 16:47:13,635 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 38 states. [2018-01-24 16:47:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:16,310 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-24 16:47:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 16:47:16,310 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-01-24 16:47:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:16,311 INFO L225 Difference]: With dead ends: 181 [2018-01-24 16:47:16,311 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 16:47:16,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=623, Invalid=8687, Unknown=2, NotChecked=0, Total=9312 [2018-01-24 16:47:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 16:47:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2018-01-24 16:47:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 16:47:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-01-24 16:47:16,327 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 37 [2018-01-24 16:47:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:16,327 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-01-24 16:47:16,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 16:47:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-01-24 16:47:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:47:16,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:16,328 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:16,328 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:16,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1302548335, now seen corresponding path program 1 times [2018-01-24 16:47:16,328 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:16,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:16,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:47:16,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:16,329 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:16,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:16,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:16,974 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:16,974 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 16:47:16,975 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [17], [20], [23], [27], [28], [31], [36], [37], [43], [45], [50], [53], [59], [61], [66], [80], [85], [91], [93], [94], [95], [96], [97], [108], [109], [110], [112] [2018-01-24 16:47:16,976 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:47:16,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:47:17,104 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:47:17,104 INFO L268 AbstractInterpreter]: Visited 35 different actions 48 times. Merged at 9 different actions 12 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-01-24 16:47:17,112 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:47:17,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:17,112 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:47:17,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:17,118 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:17,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:17,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:17,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:17,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:47:17,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:17,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:17,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:17,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:17,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:47:17,227 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 2 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 16:47:17,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:17,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:17,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2018-01-24 16:47:17,271 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 38 treesize of output 35 [2018-01-24 16:47:17,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:17,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,297 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 34 treesize of output 31 [2018-01-24 16:47:17,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:17,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,320 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 28 treesize of output 25 [2018-01-24 16:47:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:17,321 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,339 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 24 treesize of output 21 [2018-01-24 16:47:17,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:17,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,344 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:17,355 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2018-01-24 16:47:17,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 16:47:17,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-01-24 16:47:17,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-01-24 16:47:17,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:17,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-01-24 16:47:17,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:17,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,468 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-24 16:47:17,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:17,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,483 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:17,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:47:17,492 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2018-01-24 16:47:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:17,913 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:18,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:18,792 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:18,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:18,795 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:18,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:18,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:18,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:18,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:47:18,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:18,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:18,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:18,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:18,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:18,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:18,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:47:19,012 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:19,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:19,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:35 [2018-01-24 16:47:19,076 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 37 treesize of output 34 [2018-01-24 16:47:19,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:19,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-01-24 16:47:19,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:19,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-01-24 16:47:19,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:19,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,152 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 33 treesize of output 30 [2018-01-24 16:47:19,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:19,154 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,160 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:19,174 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:70, output treesize:55 [2018-01-24 16:47:19,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-24 16:47:19,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 16:47:19,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 16:47:19,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:19,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-01-24 16:47:19,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:19,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,354 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 16:47:19,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:19,366 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,370 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:19,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:47:19,380 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:83, output treesize:32 [2018-01-24 16:47:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:20,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:22,104 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:22,104 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:52, output treesize:1 [2018-01-24 16:47:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:22,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:47:22,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17, 19, 18] total 73 [2018-01-24 16:47:22,113 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:47:22,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 16:47:22,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 16:47:22,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=5057, Unknown=2, NotChecked=0, Total=5402 [2018-01-24 16:47:22,114 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-01-24 16:47:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:24,475 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2018-01-24 16:47:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:47:24,475 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2018-01-24 16:47:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:24,476 INFO L225 Difference]: With dead ends: 188 [2018-01-24 16:47:24,476 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 16:47:24,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=632, Invalid=7556, Unknown=2, NotChecked=0, Total=8190 [2018-01-24 16:47:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 16:47:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168. [2018-01-24 16:47:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 16:47:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-01-24 16:47:24,492 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 38 [2018-01-24 16:47:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:24,493 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-01-24 16:47:24,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 16:47:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-01-24 16:47:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:47:24,493 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:24,493 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:24,493 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1983850505, now seen corresponding path program 2 times [2018-01-24 16:47:24,494 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:24,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:24,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:24,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:24,494 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:24,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:25,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:25,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:25,070 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:47:25,070 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:47:25,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:25,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:47:25,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:25,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:25,090 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:25,103 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:25,113 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:25,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:25,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:25,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:25,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:47:25,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:25,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 16:47:25,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-24 16:47:25,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,236 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 12 treesize of output 15 [2018-01-24 16:47:25,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:25,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:25,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 16:47:25,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:47:25,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-24 16:47:25,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:47:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:25,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-01-24 16:47:25,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-24 16:47:25,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-24 16:47:25,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:47:25,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:47:25,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:25,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:25,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-01-24 16:47:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:25,801 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:26,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:26,920 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:26,923 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:26,923 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:26,945 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:27,018 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:27,053 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:27,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:27,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:27,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:47:27,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:27,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:27,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:27,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:27,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:27,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:47:27,234 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:27,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:27,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:27,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:35 [2018-01-24 16:47:27,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-01-24 16:47:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:27,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:27,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-01-24 16:47:27,307 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:47:27,307 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:47:27,311 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:47:27,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:47:27 BoogieIcfgContainer [2018-01-24 16:47:27,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:47:27,312 INFO L168 Benchmark]: Toolchain (without parser) took 54502.16 ms. Allocated memory was 307.8 MB in the beginning and 753.4 MB in the end (delta: 445.6 MB). Free memory was 267.7 MB in the beginning and 617.7 MB in the end (delta: -350.1 MB). Peak memory consumption was 95.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:27,313 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:47:27,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 256.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:27,313 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:27,314 INFO L168 Benchmark]: RCFGBuilder took 389.32 ms. Allocated memory is still 307.8 MB. Free memory was 254.5 MB in the beginning and 230.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:27,314 INFO L168 Benchmark]: TraceAbstraction took 53860.10 ms. Allocated memory was 307.8 MB in the beginning and 753.4 MB in the end (delta: 445.6 MB). Free memory was 230.4 MB in the beginning and 617.7 MB in the end (delta: -387.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:27,316 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.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 256.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 389.32 ms. Allocated memory is still 307.8 MB. Free memory was 254.5 MB in the beginning and 230.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53860.10 ms. Allocated memory was 307.8 MB in the beginning and 753.4 MB in the end (delta: 445.6 MB). Free memory was 230.4 MB in the beginning and 617.7 MB in the end (delta: -387.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 376 LocStat_NO_SUPPORTING_DISEQUALITIES : 153 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 91 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.767713 RENAME_VARIABLES(MILLISECONDS) : 0.501660 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.698934 PROJECTAWAY(MILLISECONDS) : 0.378669 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001356 DISJOIN(MILLISECONDS) : 0.730073 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.544607 ADD_EQUALITY(MILLISECONDS) : 0.015985 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012976 #CONJOIN_DISJUNCTIVE : 74 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 165 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 109 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 379 LocStat_NO_SUPPORTING_DISEQUALITIES : 153 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 91 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.828843 RENAME_VARIABLES(MILLISECONDS) : 0.402525 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.776833 PROJECTAWAY(MILLISECONDS) : 0.381606 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001089 DISJOIN(MILLISECONDS) : 0.762663 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.444411 ADD_EQUALITY(MILLISECONDS) : 0.022155 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011846 #CONJOIN_DISJUNCTIVE : 74 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 165 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 109 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 476 LocStat_NO_SUPPORTING_DISEQUALITIES : 190 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 101 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.941301 RENAME_VARIABLES(MILLISECONDS) : 0.245314 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.431026 PROJECTAWAY(MILLISECONDS) : 0.051230 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001291 DISJOIN(MILLISECONDS) : 0.596674 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.276777 ADD_EQUALITY(MILLISECONDS) : 0.018013 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010636 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 89 #UNFREEZE : 0 #CONJOIN : 173 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 43 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 87 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 462 LocStat_NO_SUPPORTING_DISEQUALITIES : 193 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 101 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.742568 RENAME_VARIABLES(MILLISECONDS) : 0.359705 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.705049 PROJECTAWAY(MILLISECONDS) : 0.373586 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000960 DISJOIN(MILLISECONDS) : 0.679385 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.393410 ADD_EQUALITY(MILLISECONDS) : 0.017027 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013033 #CONJOIN_DISJUNCTIVE : 82 #RENAME_VARIABLES : 118 #UNFREEZE : 0 #CONJOIN : 179 #PROJECTAWAY : 101 #ADD_WEAK_EQUALITY : 37 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 117 #ADD_EQUALITY : 123 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 71 locations, 21 error locations. TIMEOUT Result, 53.8s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 926 SDtfs, 1422 SDslu, 6851 SDs, 0 SdLazy, 6479 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 431 SyntacticMatches, 29 SemanticMatches, 632 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11631 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 202 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1244 ConstructedInterpolants, 266 QuantifiedInterpolants, 753581 SizeOfPredicates, 247 NumberOfNonLiveVariables, 2154 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 41 InterpolantComputations, 16 PerfectInterpolantSequences, 4/119 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-47-27-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-47-27-328.csv Completed graceful shutdown