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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:48:33,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:48:33,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:48:33,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:48:33,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:48:33,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:48:33,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:48:33,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:48:33,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:48:33,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:48:33,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:48:33,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:48:33,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:48:33,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:48:33,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:48:33,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:48:33,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:48:33,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:48:33,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:48:33,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:48:33,844 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:48:33,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:48:33,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:48:33,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:48:33,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:48:33,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:48:33,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:48:33,848 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:48:33,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:48:33,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:48:33,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:48:33,849 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:48:33,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:48:33,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:48:33,860 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:48:33,860 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:48:33,860 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:48:33,861 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:48:33,861 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:48:33,861 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:48:33,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:48:33,862 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:48:33,862 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:48:33,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:48:33,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:48:33,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:48:33,863 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:48:33,863 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:48:33,863 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:48:33,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:48:33,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:48:33,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:48:33,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:48:33,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:48:33,864 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:48:33,865 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:48:33,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:48:33,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:48:33,865 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:48:33,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:48:33,866 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:48:33,866 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:48:33,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:48:33,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:48:33,866 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:48:33,867 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:48:33,867 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:48:33,868 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:48:33,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:48:33,914 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:48:33,918 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:48:33,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:48:33,920 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:48:33,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:48:34,095 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:48:34,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:48:34,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:48:34,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:48:34,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:48:34,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d1a502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34, skipping insertion in model container [2018-01-24 16:48:34,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,122 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:48:34,158 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:48:34,273 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:48:34,290 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:48:34,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34 WrapperNode [2018-01-24 16:48:34,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:48:34,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:48:34,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:48:34,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:48:34,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (1/1) ... [2018-01-24 16:48:34,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:48:34,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:48:34,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:48:34,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:48:34,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (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:48:34,390 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:48:34,391 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:48:34,391 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-24 16:48:34,391 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:48:34,391 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:48:34,392 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-24 16:48:34,392 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:48:34,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:48:34,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:48:34,601 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:48:34,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:48:34 BoogieIcfgContainer [2018-01-24 16:48:34,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:48:34,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:48:34,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:48:34,604 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:48:34,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:48:34" (1/3) ... [2018-01-24 16:48:34,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fedd6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:48:34, skipping insertion in model container [2018-01-24 16:48:34,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:48:34" (2/3) ... [2018-01-24 16:48:34,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fedd6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:48:34, skipping insertion in model container [2018-01-24 16:48:34,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:48:34" (3/3) ... [2018-01-24 16:48:34,608 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:48:34,614 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:48:34,619 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 16:48:34,656 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:48:34,656 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:48:34,657 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:48:34,657 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:48:34,657 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:48:34,657 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:48:34,657 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:48:34,657 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:48:34,658 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:48:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 16:48:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:48:34,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:34,686 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:34,687 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-24 16:48:34,695 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:34,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:34,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:34,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:34,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:34,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:34,896 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:48:34,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:34,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:48:34,898 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:34,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:48:34,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:48:34,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:48:34,979 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 16:48:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,079 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-24 16:48:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:48:35,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:48:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,091 INFO L225 Difference]: With dead ends: 79 [2018-01-24 16:48:35,092 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:48:35,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:48:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:48:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:48:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:48:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 16:48:35,131 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-24 16:48:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:35,131 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 16:48:35,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:48:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 16:48:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:48:35,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:35,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:35,132 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-24 16:48:35,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:35,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:35,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:35,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:35,272 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:48:35,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:35,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:48:35,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:35,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:35,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:35,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:35,275 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-24 16:48:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,353 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-24 16:48:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:35,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:48:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,355 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:48:35,355 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:48:35,356 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:48:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:48:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:48:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:48:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 16:48:35,363 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-24 16:48:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:35,363 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 16:48:35,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 16:48:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:48:35,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:35,364 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:35,364 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-24 16:48:35,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:35,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:35,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:35,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:35,417 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:48:35,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:35,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:48:35,417 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:35,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:48:35,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:48:35,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:48:35,418 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 16:48:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,483 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 16:48:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:48:35,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:48:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,484 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:48:35,484 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:48:35,485 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:48:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:48:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:48:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:48:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-24 16:48:35,492 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-24 16:48:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:35,493 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-24 16:48:35,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:48:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-24 16:48:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:48:35,493 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:35,494 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:35,494 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-24 16:48:35,494 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:35,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:35,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:35,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:35,569 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:48:35,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:35,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:48:35,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:35,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:48:35,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:48:35,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:48:35,571 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-24 16:48:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,604 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-24 16:48:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:35,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:48:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,605 INFO L225 Difference]: With dead ends: 49 [2018-01-24 16:48:35,605 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 16:48:35,606 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:48:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 16:48:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 16:48:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 16:48:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 16:48:35,610 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-24 16:48:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:35,610 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 16:48:35,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:48:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 16:48:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:48:35,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:35,611 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:35,611 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:35,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-24 16:48:35,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:35,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:35,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:35,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:35,664 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:48:35,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:35,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:48:35,664 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:35,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:48:35,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:48:35,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:48:35,665 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-24 16:48:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,731 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 16:48:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:48:35,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 16:48:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,732 INFO L225 Difference]: With dead ends: 48 [2018-01-24 16:48:35,733 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 16:48:35,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 16:48:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 16:48:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:48:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-24 16:48:35,738 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-24 16:48:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:35,739 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-24 16:48:35,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:48:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-24 16:48:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:48:35,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:35,740 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:35,740 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-24 16:48:35,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:35,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:35,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:35,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:35,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:35,875 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:48:35,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:35,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:48:35,876 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:35,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:48:35,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:48:35,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:48:35,877 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-24 16:48:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:35,992 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 16:48:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:48:35,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 16:48:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:35,995 INFO L225 Difference]: With dead ends: 63 [2018-01-24 16:48:35,995 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 16:48:35,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:48:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 16:48:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 16:48:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:48:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 16:48:36,003 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-24 16:48:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:36,003 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 16:48:36,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:48:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 16:48:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:48:36,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:36,004 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:36,004 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-24 16:48:36,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:36,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:36,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:36,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:36,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:36,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:48:36,054 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:36,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:36,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:36,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:36,055 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 16:48:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:36,142 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 16:48:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:36,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 16:48:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:36,144 INFO L225 Difference]: With dead ends: 53 [2018-01-24 16:48:36,144 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:48:36,145 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:48:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:48:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:48:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:48:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 16:48:36,149 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-24 16:48:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:36,150 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 16:48:36,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 16:48:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:48:36,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:36,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:36,151 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-24 16:48:36,151 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:36,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:36,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,152 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:36,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:36,274 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:48:36,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:36,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:48:36,274 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:36,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:48:36,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:48:36,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:48:36,275 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 16:48:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:36,398 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 16:48:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:48:36,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 16:48:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:36,399 INFO L225 Difference]: With dead ends: 63 [2018-01-24 16:48:36,399 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 16:48:36,400 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:48:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 16:48:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 16:48:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:48:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 16:48:36,406 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-24 16:48:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:36,406 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 16:48:36,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:48:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 16:48:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:48:36,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:36,407 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] [2018-01-24 16:48:36,408 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-24 16:48:36,408 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:36,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:36,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:36,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:36,456 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:48:36,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:36,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:48:36,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:36,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:36,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:36,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:36,457 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 16:48:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:36,523 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 16:48:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:36,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:48:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:36,524 INFO L225 Difference]: With dead ends: 53 [2018-01-24 16:48:36,524 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:48:36,524 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:48:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:48:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:48:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:48:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 16:48:36,530 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 16:48:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:36,531 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 16:48:36,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 16:48:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:48:36,532 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:36,532 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] [2018-01-24 16:48:36,532 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-24 16:48:36,532 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:36,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:36,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:36,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:36,702 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:48:36,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:36,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:48:36,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:36,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:48:36,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:48:36,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:48:36,703 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 16:48:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:36,857 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-24 16:48:36,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:48:36,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:48:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:36,858 INFO L225 Difference]: With dead ends: 64 [2018-01-24 16:48:36,858 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 16:48:36,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:48:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 16:48:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-24 16:48:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:48:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 16:48:36,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-24 16:48:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:36,873 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 16:48:36,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:48:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 16:48:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:48:36,874 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:36,874 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] [2018-01-24 16:48:36,874 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-24 16:48:36,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:36,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:36,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:36,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:36,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:36,951 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:48:36,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:36,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:48:36,951 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:36,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:36,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:36,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:36,952 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 16:48:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:37,002 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 16:48:37,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:37,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:48:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:37,003 INFO L225 Difference]: With dead ends: 53 [2018-01-24 16:48:37,003 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:48:37,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:48:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:48:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:48:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:48:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 16:48:37,007 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 16:48:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:37,007 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 16:48:37,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 16:48:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:48:37,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:37,008 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] [2018-01-24 16:48:37,008 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-24 16:48:37,009 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:37,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:37,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,010 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:37,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:37,100 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:48:37,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:37,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:48:37,100 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:37,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:48:37,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:48:37,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:48:37,101 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 16:48:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:37,206 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-24 16:48:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:48:37,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:48:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:37,207 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:48:37,207 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 16:48:37,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:48:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 16:48:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 16:48:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:48:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-24 16:48:37,211 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-24 16:48:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:37,211 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-24 16:48:37,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:48:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-24 16:48:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:48:37,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:37,212 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:48:37,212 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-24 16:48:37,212 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:37,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:37,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:37,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:37,437 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:48:37,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:37,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:48:37,437 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:37,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:48:37,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:48:37,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:48:37,438 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-24 16:48:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:37,639 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-24 16:48:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:48:37,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 16:48:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:37,641 INFO L225 Difference]: With dead ends: 85 [2018-01-24 16:48:37,641 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 16:48:37,642 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:48:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 16:48:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-24 16:48:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:48:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-24 16:48:37,647 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-24 16:48:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:37,648 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-24 16:48:37,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:48:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-24 16:48:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:48:37,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:37,649 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] [2018-01-24 16:48:37,649 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:37,649 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-24 16:48:37,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:37,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:37,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:37,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:48:37,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:37,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:48:37,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:37,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:37,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:37,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:37,746 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-24 16:48:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:37,776 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-24 16:48:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:37,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 16:48:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:37,777 INFO L225 Difference]: With dead ends: 80 [2018-01-24 16:48:37,778 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 16:48:37,778 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:48:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 16:48:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-24 16:48:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:48:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-24 16:48:37,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-24 16:48:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:37,783 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-24 16:48:37,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-24 16:48:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:48:37,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:37,784 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] [2018-01-24 16:48:37,784 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-24 16:48:37,784 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:37,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:37,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:37,785 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:37,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:37,978 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 17 DAG size of output 8 [2018-01-24 16:48:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:38,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:38,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:48:38,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:38,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:48:38,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:48:38,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:48:38,028 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-24 16:48:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:38,272 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-24 16:48:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:48:38,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 16:48:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:38,273 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:48:38,273 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 16:48:38,274 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:48:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 16:48:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-24 16:48:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 16:48:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-24 16:48:38,281 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-24 16:48:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:38,281 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-24 16:48:38,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:48:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-24 16:48:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:48:38,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:38,283 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] [2018-01-24 16:48:38,283 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-24 16:48:38,283 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:38,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:38,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:38,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:38,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:38,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:48:38,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:38,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:48:38,354 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:38,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:38,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:38,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:38,355 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-24 16:48:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:38,438 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-24 16:48:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:48:38,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-24 16:48:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:38,440 INFO L225 Difference]: With dead ends: 128 [2018-01-24 16:48:38,440 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 16:48:38,441 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:48:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 16:48:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 16:48:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 16:48:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-24 16:48:38,450 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-24 16:48:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:38,450 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-24 16:48:38,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-24 16:48:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:48:38,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:38,451 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] [2018-01-24 16:48:38,452 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-24 16:48:38,452 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:38,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:38,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:38,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:38,453 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:38,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:38,678 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:48:38,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:38,679 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:38,680 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 16:48:38,681 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [17], [18], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 16:48:38,726 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:48:38,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:48:38,999 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:48:39,001 INFO L268 AbstractInterpreter]: Visited 24 different actions 37 times. Merged at 7 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:48:39,027 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:48:39,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:39,027 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:48:39,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:39,040 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:39,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:39,135 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:48:39,137 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:48:39,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,145 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:48:39,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:48:39,307 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 16 [2018-01-24 16:48:39,317 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:48:39,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:39,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:39,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:39,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 16:48:39,388 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:48:39,388 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:39,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:48:39,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,645 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 15 treesize of output 13 [2018-01-24 16:48:39,720 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 7 treesize of output 3 [2018-01-24 16:48:39,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 16:48:39,759 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:48:39,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:39,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 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:48:39,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:39,797 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:39,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:39,904 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:48:39,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:48:39,914 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:48:39,916 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:48:39,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:39,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:48:40,025 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:48:40,031 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:48:40,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:40,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:40,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:40,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 16:48:40,121 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:48:40,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:40,254 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 13 treesize of output 11 [2018-01-24 16:48:40,261 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 5 treesize of output 3 [2018-01-24 16:48:40,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:40,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:40,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:40,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:48:40,318 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:48:40,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:48:40,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-24 16:48:40,320 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:48:40,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:48:40,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:48:40,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 16:48:40,322 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 17 states. [2018-01-24 16:48:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:41,492 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-01-24 16:48:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:48:41,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-01-24 16:48:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:41,494 INFO L225 Difference]: With dead ends: 135 [2018-01-24 16:48:41,494 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 16:48:41,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 16:48:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 16:48:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-01-24 16:48:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 16:48:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-01-24 16:48:41,506 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2018-01-24 16:48:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:41,506 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-01-24 16:48:41,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:48:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-01-24 16:48:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:48:41,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:41,508 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:41,508 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-01-24 16:48:41,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:41,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:41,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:41,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:41,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:41,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:41,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:41,794 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:41,794 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:48:41,794 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [18], [20], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 16:48:41,795 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:48:41,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:48:41,957 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:48:41,957 INFO L268 AbstractInterpreter]: Visited 24 different actions 37 times. Merged at 7 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:48:41,972 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:48:41,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:41,972 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:48:41,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:41,982 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:42,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:42,018 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:48:42,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:42,025 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:48:42,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:42,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:42,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:48:42,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:42,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:42,106 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:48:42,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:42,115 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:48:42,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:42,122 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:48:42,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:48:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:42,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:42,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:42,660 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:48:42,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:42,663 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:42,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:42,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:43,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:48:43,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:43,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:43,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:14 [2018-01-24 16:48:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:43,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:48:43,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10, 11, 11] total 45 [2018-01-24 16:48:43,237 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:48:43,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 16:48:43,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 16:48:43,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1872, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 16:48:43,238 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-01-24 16:48:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:43,780 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-01-24 16:48:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:48:43,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-01-24 16:48:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:43,782 INFO L225 Difference]: With dead ends: 113 [2018-01-24 16:48:43,782 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:48:43,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=329, Invalid=2641, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 16:48:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:48:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-01-24 16:48:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 16:48:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-01-24 16:48:43,790 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-01-24 16:48:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:43,790 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-01-24 16:48:43,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 16:48:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-01-24 16:48:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:48:43,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:43,791 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] [2018-01-24 16:48:43,791 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-01-24 16:48:43,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:43,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:43,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:43,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:43,792 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:43,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:48:43,939 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:48:43,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:43,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:48:43,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:43,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:48:43,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:48:43,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:48:43,940 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 8 states. [2018-01-24 16:48:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:44,009 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-01-24 16:48:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:48:44,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-24 16:48:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:44,010 INFO L225 Difference]: With dead ends: 131 [2018-01-24 16:48:44,010 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 16:48:44,011 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:48:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 16:48:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-01-24 16:48:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 16:48:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-01-24 16:48:44,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-01-24 16:48:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:44,017 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-01-24 16:48:44,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:48:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-01-24 16:48:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:48:44,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:44,018 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] [2018-01-24 16:48:44,018 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-01-24 16:48:44,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:44,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:44,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:44,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:44,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:44,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:48:44,247 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:44,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:48:44,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:48:44,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:48:44,248 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-01-24 16:48:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:44,471 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-24 16:48:44,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:48:44,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-24 16:48:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:44,472 INFO L225 Difference]: With dead ends: 127 [2018-01-24 16:48:44,472 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:48:44,473 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-01-24 16:48:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:48:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-01-24 16:48:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 16:48:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-01-24 16:48:44,479 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-01-24 16:48:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:44,479 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-01-24 16:48:44,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:48:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-01-24 16:48:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:48:44,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:44,480 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:48:44,480 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-01-24 16:48:44,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:44,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:44,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,482 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:44,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:44,605 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:48:44,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:48:44,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:48:44,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:48:44,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:48:44,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:48:44,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:48:44,606 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-01-24 16:48:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:44,723 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-24 16:48:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:48:44,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 16:48:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:44,724 INFO L225 Difference]: With dead ends: 92 [2018-01-24 16:48:44,724 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:48:44,724 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:48:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:48:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 16:48:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:48:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-24 16:48:44,729 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 30 [2018-01-24 16:48:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:44,730 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-24 16:48:44,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:48:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-24 16:48:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:48:44,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:44,731 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] [2018-01-24 16:48:44,731 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-01-24 16:48:44,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:44,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:44,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:44,732 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:44,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:48:45,079 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:48:45,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:45,079 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:45,079 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 16:48:45,080 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [12], [34], [37], [38], [46], [48], [49], [51], [56], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 16:48:45,081 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:48:45,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:48:45,177 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:48:45,177 INFO L268 AbstractInterpreter]: Visited 28 different actions 33 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-01-24 16:48:45,202 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:48:45,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:45,202 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:48:45,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:45,212 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:45,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:45,244 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:48:45,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:48:45,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:45,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:45,263 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:48:45,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:48:45,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, 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 11 [2018-01-24 16:48:45,311 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:48:45,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,365 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:48:45,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:48:45,455 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 22 treesize of output 23 [2018-01-24 16:48:45,457 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:48:45,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 16:48:45,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:48:45,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 16:48:45,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:48:45,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,541 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:48:45,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:45,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:45,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:45,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-24 16:48:45,590 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:48:45,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:45,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:48:45,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,819 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 13 treesize of output 11 [2018-01-24 16:48:45,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:48:45,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 16:48:45,864 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:48:45,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:45,886 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:48:45,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:45,889 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:45,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:45,938 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:48:45,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:48:45,948 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:48:45,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:45,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:45,955 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:48:45,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-24 16:48:45,991 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:48:45,992 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:48:45,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:45,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:48:46,086 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 23 treesize of output 24 [2018-01-24 16:48:46,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 8 treesize of output 7 [2018-01-24 16:48:46,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,096 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:48:46,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-01-24 16:48:46,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-01-24 16:48:46,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:48:46,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,187 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:48:46,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:46,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:46,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:46,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-01-24 16:48:46,282 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:48:46,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:46,409 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 13 treesize of output 11 [2018-01-24 16:48:46,416 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 5 treesize of output 3 [2018-01-24 16:48:46,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:46,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:48:46,509 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:48:46,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:48:46,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10, 14, 12] total 44 [2018-01-24 16:48:46,511 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:48:46,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 16:48:46,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 16:48:46,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 16:48:46,512 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 23 states. [2018-01-24 16:48:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:47,583 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 16:48:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:48:47,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-01-24 16:48:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:47,583 INFO L225 Difference]: With dead ends: 65 [2018-01-24 16:48:47,584 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 16:48:47,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=318, Invalid=2762, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 16:48:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 16:48:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-24 16:48:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 16:48:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-24 16:48:47,588 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 30 [2018-01-24 16:48:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:47,588 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-24 16:48:47,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 16:48:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-24 16:48:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:48:47,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:47,589 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:48:47,589 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-01-24 16:48:47,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:47,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:47,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:47,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:47,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:47,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:47,805 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:48:47,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:47,805 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:47,806 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 16:48:47,806 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [12], [14], [15], [18], [25], [34], [37], [38], [46], [48], [51], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 16:48:47,807 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:48:47,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:48:47,970 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:48:47,970 INFO L268 AbstractInterpreter]: Visited 30 different actions 52 times. Merged at 13 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-01-24 16:48:47,993 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:48:47,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:47,993 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:48:48,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:48,002 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:48,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:48,035 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:48:48,037 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:48:48,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,045 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:48:48,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:48:48,162 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 16 [2018-01-24 16:48:48,168 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:48:48,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 16:48:48,215 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:48:48,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:48,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:48:48,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,400 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 13 treesize of output 11 [2018-01-24 16:48:48,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:48:48,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,413 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:48:48,418 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:48:48,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:48,438 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:48:48,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:48,441 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:48:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:48,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:48,521 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:48:48,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:48:48,530 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:48:48,531 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:48:48,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:48:48,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, 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:48:48,633 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:48:48,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:48,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 16:48:48,718 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:48:48,718 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:48,828 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 13 treesize of output 11 [2018-01-24 16:48:48,837 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 5 treesize of output 3 [2018-01-24 16:48:48,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:48,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:48:48,911 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:48:48,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:48:48,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-24 16:48:48,913 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:48:48,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:48:48,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:48:48,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 16:48:48,914 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 17 states. [2018-01-24 16:48:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:49,448 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-24 16:48:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:48:49,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-01-24 16:48:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:49,449 INFO L225 Difference]: With dead ends: 68 [2018-01-24 16:48:49,449 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:48:49,450 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1602, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 16:48:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:48:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 16:48:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 16:48:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-24 16:48:49,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 32 [2018-01-24 16:48:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:49,455 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-24 16:48:49,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:48:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-24 16:48:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:48:49,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:49,456 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:48:49,456 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-01-24 16:48:49,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:49,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:49,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:48:49,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:49,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:49,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:49,806 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-24 16:48:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:49,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:49,969 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:49,969 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:48:49,969 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:48:49,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:49,969 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:48:49,977 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:48:49,977 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:48:49,992 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:50,000 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:50,002 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:48:50,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:50,008 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:48:50,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:48:50,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:50,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:50,018 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:48:50,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,023 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:48:50,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:48:50,065 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:48:50,067 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:48:50,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,075 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:48:50,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 16:48:50,235 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 24 treesize of output 25 [2018-01-24 16:48:50,240 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:48:50,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,256 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:48:50,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 16:48:50,316 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 18 [2018-01-24 16:48:50,321 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:48:50,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:50,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:50,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:50,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 16:48:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:50,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:50,852 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 39 treesize of output 30 [2018-01-24 16:48:50,867 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:48:50,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,880 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:48:50,882 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:48:50,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,886 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:48:50,887 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:48:50,887 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:50,903 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:48:50,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:48:50,922 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 16:48:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:51,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:51,138 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:48:51,141 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:48:51,141 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:48:51,159 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:51,186 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:51,250 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:48:51,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:51,258 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:48:51,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:48:51,269 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:48:51,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:51,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:51,275 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:48:51,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:48:51,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:51,313 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:48:51,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:48:51,488 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 23 treesize of output 24 [2018-01-24 16:48:51,489 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:48:51,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 16:48:51,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-24 16:48:51,579 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 17 treesize of output 14 [2018-01-24 16:48:51,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:51,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:51,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:48:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:51,619 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:51,794 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 39 treesize of output 30 [2018-01-24 16:48:51,811 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:48:51,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,825 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:48:51,827 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:48:51,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,832 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:48:51,834 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:48:51,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:51,848 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:48:51,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:48:51,868 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:48:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:52,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:48:52,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 51 [2018-01-24 16:48:52,127 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:48:52,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 16:48:52,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 16:48:52,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 16:48:52,128 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 26 states. [2018-01-24 16:48:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:48:53,356 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 16:48:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:48:53,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-01-24 16:48:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:48:53,357 INFO L225 Difference]: With dead ends: 69 [2018-01-24 16:48:53,357 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 16:48:53,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=457, Invalid=4235, Unknown=0, NotChecked=0, Total=4692 [2018-01-24 16:48:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 16:48:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-24 16:48:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:48:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 16:48:53,363 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-01-24 16:48:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:48:53,363 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 16:48:53,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 16:48:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 16:48:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:48:53,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:48:53,364 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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:48:53,364 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:48:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-01-24 16:48:53,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:48:53,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:53,365 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:48:53,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:48:53,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:48:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:48:53,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:48:53,977 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:48:53,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:54,016 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:48:54,016 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:48:54,017 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:48:54,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:54,017 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:48:54,021 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:48:54,022 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:48:54,032 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:54,037 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:54,039 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:48:54,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:54,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:48:54,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:48:54,073 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:48:54,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:54,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:54,079 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:48:54,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:48:54,122 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:48:54,124 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:48:54,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,135 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:48:54,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 16:48:54,244 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 24 treesize of output 25 [2018-01-24 16:48:54,246 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:48:54,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:48:54,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-01-24 16:48:54,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 16:48:54,429 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:48:54,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:54,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:48:54,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:54,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:54,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 16:48:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:54,499 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:48:54,888 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 13 treesize of output 11 [2018-01-24 16:48:54,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:48:54,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:54,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-24 16:48:54,988 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:48:55,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:48:55,017 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:48:55,021 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:48:55,021 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:48:55,039 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:55,062 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:48:55,110 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:48:55,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:48:55,118 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:48:55,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:48:55,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:55,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:48:55,122 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:48:55,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,127 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:48:55,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:48:55,201 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:48:55,202 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:48:55,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:48:55,327 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 23 treesize of output 24 [2018-01-24 16:48:55,329 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:48:55,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,336 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:48:55,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-01-24 16:48:55,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 16:48:55,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:48:55,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:48:55,386 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:48:55,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:48:55,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:55,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:48:55,398 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 16:48:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:48:55,402 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:01,680 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 13 treesize of output 11 [2018-01-24 16:49:01,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:49:01,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:01,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:01,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:01,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:49:01,796 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:49:01,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:01,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 12, 15, 12] total 51 [2018-01-24 16:49:01,798 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:01,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 16:49:01,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 16:49:01,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2468, Unknown=3, NotChecked=0, Total=2652 [2018-01-24 16:49:01,799 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 32 states. [2018-01-24 16:49:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:03,038 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 16:49:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:49:03,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-01-24 16:49:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:03,039 INFO L225 Difference]: With dead ends: 66 [2018-01-24 16:49:03,039 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:49:03,040 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=490, Invalid=4063, Unknown=3, NotChecked=0, Total=4556 [2018-01-24 16:49:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:49:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:49:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:49:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 16:49:03,044 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 34 [2018-01-24 16:49:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:03,045 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 16:49:03,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 16:49:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 16:49:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:49:03,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:03,045 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:03,045 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:49:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-01-24 16:49:03,045 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:03,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:03,046 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:49:03,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:03,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:03,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:03,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:03,387 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:03,387 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:49:03,387 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:49:03,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:03,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:49:03,400 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:03,400 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:03,417 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:03,429 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:03,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:03,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:03,446 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:49:03,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:03,454 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:49:03,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:03,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:49:03,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:03,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:03,476 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:49:03,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:03,487 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:49:03,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:03,494 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:49:03,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:49:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:03,824 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:04,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:04,324 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:49:04,327 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:04,327 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:04,346 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:04,375 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:04,420 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:04,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:04,432 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:49:04,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,441 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:49:04,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:49:04,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:04,454 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:49:04,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:04,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:04,464 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:49:04,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,468 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:49:04,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:49:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:04,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:04,662 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:04,663 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2018-01-24 16:49:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:04,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:04,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 13] total 36 [2018-01-24 16:49:04,669 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:04,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:49:04,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:49:04,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 16:49:04,670 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 21 states. [2018-01-24 16:49:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:05,239 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 16:49:05,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:49:05,240 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-01-24 16:49:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:05,240 INFO L225 Difference]: With dead ends: 67 [2018-01-24 16:49:05,240 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 16:49:05,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 102 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=2033, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 16:49:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 16:49:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-24 16:49:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 16:49:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-24 16:49:05,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-01-24 16:49:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:05,245 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-24 16:49:05,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:49:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-24 16:49:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:49:05,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:05,246 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:05,246 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:49:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-01-24 16:49:05,246 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:05,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:05,247 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:49:05,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:05,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:05,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:05,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:05,945 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:05,946 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-01-24 16:49:05,946 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [12], [14], [15], [18], [25], [34], [37], [38], [46], [48], [49], [51], [56], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 16:49:05,947 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:49:05,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:49:06,128 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:49:06,128 INFO L268 AbstractInterpreter]: Visited 32 different actions 61 times. Merged at 15 different actions 27 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 34 variables. [2018-01-24 16:49:06,132 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:49:06,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:06,132 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:49:06,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:06,140 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:49:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:06,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:06,167 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:49:06,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:49:06,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:06,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:06,193 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:49:06,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,198 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:49:06,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:49:06,230 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:49:06,233 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:49:06,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:49:06,346 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 23 treesize of output 24 [2018-01-24 16:49:06,347 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:49:06,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-01-24 16:49:06,382 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 23 treesize of output 24 [2018-01-24 16:49:06,385 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:49:06,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,394 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:49:06,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 16:49:06,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 16:49:06,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:49:06,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,463 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 17 treesize of output 14 [2018-01-24 16:49:06,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:06,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:06,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:06,472 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-24 16:49:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:06,517 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:06,948 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:49:06,960 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:49:06,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,973 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:49:06,976 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:49:06,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,981 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:49:06,983 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:49:06,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:06,996 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:49:07,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:49:07,016 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:49:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:07,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:07,197 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 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 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:49:07,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:07,201 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:49:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:07,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:07,294 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:49:07,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:49:07,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:07,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:07,328 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:49:07,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,335 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:49:07,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:49:07,350 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:49:07,352 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:49:07,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:49:07,456 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 23 treesize of output 24 [2018-01-24 16:49:07,458 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:49:07,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-01-24 16:49:07,492 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 23 treesize of output 24 [2018-01-24 16:49:07,494 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:49:07,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,507 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:49:07,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 16:49:07,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 16:49:07,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:49:07,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:07,530 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 17 treesize of output 14 [2018-01-24 16:49:07,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:07,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:07,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:07,555 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-24 16:49:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:07,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:08,140 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:49:08,155 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:49:08,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:08,168 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:49:08,170 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:49:08,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:08,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:08,173 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:49:08,175 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:49:08,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:08,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:08,188 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:49:08,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:49:08,207 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:49:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:08,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:08,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15, 16, 15] total 46 [2018-01-24 16:49:08,277 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:08,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 16:49:08,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 16:49:08,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2002, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 16:49:08,278 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 27 states. [2018-01-24 16:49:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:09,311 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 16:49:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:49:09,311 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-01-24 16:49:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:09,311 INFO L225 Difference]: With dead ends: 65 [2018-01-24 16:49:09,311 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:49:09,312 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 102 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=424, Invalid=3866, Unknown=0, NotChecked=0, Total=4290 [2018-01-24 16:49:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:49:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:49:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:49:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-24 16:49:09,317 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2018-01-24 16:49:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:09,317 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-24 16:49:09,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 16:49:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-24 16:49:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:49:09,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:09,318 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:49:09,318 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:49:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-01-24 16:49:09,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:09,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:09,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:09,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:09,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:09,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:09,932 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:49:09,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:09,932 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:09,932 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:49:09,933 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:49:09,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:09,933 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:49:09,938 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:09,938 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:09,950 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:09,957 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:09,960 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:09,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:09,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 6 treesize of output 5 [2018-01-24 16:49:09,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:09,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:09,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:49:09,970 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:49:09,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:09,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:09,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:09,977 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:49:09,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:09,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:09,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:49:10,011 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:49:10,012 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:49:10,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,017 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:49:10,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 16:49:10,135 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 24 treesize of output 25 [2018-01-24 16:49:10,137 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:49:10,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,149 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:49:10,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 16:49:10,210 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 18 [2018-01-24 16:49:10,215 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:49:10,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:10,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:10,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:10,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 16:49:10,281 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:49:10,281 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:10,765 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 39 treesize of output 30 [2018-01-24 16:49:10,778 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:49:10,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,791 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:49:10,792 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:49:10,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,796 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:49:10,797 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:49:10,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:10,810 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:49:10,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:49:10,831 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 16:49:10,999 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:49:11,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:11,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 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 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:49:11,023 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:11,023 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:11,041 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:11,071 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:11,147 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:11,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:11,162 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:49:11,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:49:11,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:49:11,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:11,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:11,180 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:49:11,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:49:11,219 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:49:11,221 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:49:11,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:49:11,398 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 23 treesize of output 24 [2018-01-24 16:49:11,400 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:49:11,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 16:49:11,486 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:49:11,492 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 17 treesize of output 14 [2018-01-24 16:49:11,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:11,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:11,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:11,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:49:11,528 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:49:11,528 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:11,664 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 39 treesize of output 30 [2018-01-24 16:49:11,678 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:49:11,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,691 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:49:11,693 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:49:11,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,696 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:49:11,698 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:49:11,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:11,711 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:49:11,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:49:11,730 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:49:11,899 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:49:11,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:11,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 51 [2018-01-24 16:49:11,901 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:11,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 16:49:11,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 16:49:11,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 16:49:11,902 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-01-24 16:49:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:12,808 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-24 16:49:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:49:12,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-24 16:49:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:12,808 INFO L225 Difference]: With dead ends: 52 [2018-01-24 16:49:12,808 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 16:49:12,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=416, Invalid=4006, Unknown=0, NotChecked=0, Total=4422 [2018-01-24 16:49:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 16:49:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 16:49:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 16:49:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-24 16:49:12,815 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-01-24 16:49:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:12,815 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-24 16:49:12,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 16:49:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-24 16:49:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 16:49:12,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:12,816 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:12,816 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:49:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-01-24 16:49:12,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:12,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,816 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:49:12,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:12,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:49:13,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:13,085 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:13,086 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:49:13,086 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:49:13,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:13,086 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:49:13,093 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 16:49:13,093 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 16:49:13,108 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:13,114 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:13,125 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:13,139 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:13,146 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:13,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:13,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 6 treesize of output 5 [2018-01-24 16:49:13,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:13,167 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:49:13,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:13,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:13,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:49:13,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:13,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:13,221 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:49:13,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:13,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, 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:49:13,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:13,232 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:49:13,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-01-24 16:49:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:13,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:13,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:13,981 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 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 21 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:49:13,984 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 16:49:13,984 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 16:49:14,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:14,029 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:14,102 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:14,202 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:49:14,268 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:14,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:14,278 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:49:14,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:14,288 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:49:14,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:14,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:14,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:49:14,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:49:14,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:14,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:14,306 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:49:14,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:14,310 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:49:14,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:49:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:14,781 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:15,440 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:15,440 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2018-01-24 16:49:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:49:15,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:15,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15, 16, 15] total 63 [2018-01-24 16:49:15,450 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:15,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:49:15,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:49:15,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3729, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 16:49:15,451 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2018-01-24 16:49:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:16,727 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-24 16:49:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:49:16,728 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-01-24 16:49:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:16,728 INFO L225 Difference]: With dead ends: 55 [2018-01-24 16:49:16,728 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:49:16,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=665, Invalid=6141, Unknown=0, NotChecked=0, Total=6806 [2018-01-24 16:49:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:49:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:49:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:49:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:49:16,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-24 16:49:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:16,731 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:49:16,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:49:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:49:16,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:49:16,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:49:17,232 WARN L146 SmtUtils]: Spent 389ms on a formula simplification. DAG size of input: 91 DAG size of output 70 [2018-01-24 16:49:17,430 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 119 DAG size of output 66 [2018-01-24 16:49:18,886 WARN L146 SmtUtils]: Spent 1453ms on a formula simplification. DAG size of input: 229 DAG size of output 131 [2018-01-24 16:49:18,889 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L397 ceAbstractionStarter]: At program point cstrlcpyENTRY(lines 540 559) the Hoare annotation is: (let ((.cse10 (select |#length| |cstrlcpy_#in~dst.base|))) (let ((.cse0 (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (.cse1 (not (= 0 |cstrlcpy_#in~dst.offset|))) (.cse2 (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|)))) (.cse6 (select |old(#memory_int)| |cstrlcpy_#in~src.base|)) (.cse3 (< 2147483647 |cstrlcpy_#in~siz|)) (.cse4 (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1))) (.cse5 (not (= .cse10 |cstrlcpy_#in~siz|))) (.cse7 (not (= 0 |cstrlcpy_#in~src.offset|))) (.cse8 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|)))))) (.cse9 (< .cse10 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (select .cse6 (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) 0)) .cse7 (exists ((main_~nondetString2~6.offset Int)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ main_~nondetString2~6.offset (select |#length| |cstrlcpy_#in~src.base|) (- 1)))) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))) .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= (select .cse6 |cstrlcpy_#in~src.offset|) 0)) .cse3 (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|)) .cse4 .cse5 .cse7 .cse8 .cse9)))) [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point cstrlcpyFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point L546'(lines 546 551) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr4RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,890 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr5RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L547'(lines 547 550) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr7RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L397 ceAbstractionStarter]: At program point L547'''(lines 547 550) the Hoare annotation is: (let ((.cse11 (select |#length| cstrlcpy_~d~2.base)) (.cse28 (select |#length| |cstrlcpy_#in~dst.base|))) (let ((.cse0 (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (.cse1 (not (= 0 |cstrlcpy_#in~dst.offset|))) (.cse10 (<= cstrlcpy_~n~2 2147483647)) (.cse13 (= 0 cstrlcpy_~s~2.offset)) (.cse17 (select |#memory_int| |cstrlcpy_#in~src.base|)) (.cse16 (= 0 cstrlcpy_~d~2.offset)) (.cse2 (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|)))) (.cse4 (< 2147483647 |cstrlcpy_#in~siz|)) (.cse5 (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1))) (.cse6 (not (= .cse28 |cstrlcpy_#in~siz|))) (.cse3 (select |old(#memory_int)| |cstrlcpy_#in~src.base|)) (.cse12 (<= 1 cstrlcpy_~siz)) (.cse15 (= 1 (select |#valid| cstrlcpy_~s~2.base))) (.cse18 (= 1 (select |#valid| cstrlcpy_~d~2.base))) (.cse19 (<= 1 .cse11)) (.cse20 (<= (div cstrlcpy_~siz 4294967296) 0)) (.cse7 (not (= 0 |cstrlcpy_#in~src.offset|))) (.cse8 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|)))))) (.cse9 (< .cse28 1)) (.cse14 (select |#length| cstrlcpy_~s~2.base))) (and (or .cse0 .cse1 .cse2 (not (= (select .cse3 |cstrlcpy_#in~src.offset|) 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= .cse11 cstrlcpy_~n~2) .cse12 .cse13 (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) cstrlcpy_~s~2.offset)) (<= 1 .cse14) .cse15 .cse16 (= 0 (select .cse17 |cstrlcpy_#in~src.offset|)) .cse18 .cse19 .cse20)) (let ((.cse26 (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) (.cse22 (not (= cstrlcpy_~d~2.base cstrlcpy_~s~2.base))) (.cse23 (<= (div cstrlcpy_~n~2 4294967296) 0)) (.cse24 (<= (+ cstrlcpy_~s~2.offset 1) .cse14)) (.cse25 (exists ((main_~nondetString2~6.offset Int)) (and (= (select (select |#memory_int| cstrlcpy_~s~2.base) (+ (select |#length| cstrlcpy_~s~2.base) main_~nondetString2~6.offset (- 1))) 0) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))))) (or .cse0 (let ((.cse21 (+ cstrlcpy_~n~2 cstrlcpy_~d~2.offset))) (and (<= .cse11 .cse21) (<= 1 cstrlcpy_~d~2.offset) (<= .cse21 .cse11) .cse12 .cse22 (<= 2 cstrlcpy_~s~2.offset) .cse15 (<= 1 cstrlcpy_~n~2) .cse23 .cse18 .cse24 .cse20 .cse25)) .cse1 (and .cse10 .cse12 (<= cstrlcpy_~n~2 .cse11) .cse22 .cse13 (<= .cse11 cstrlcpy_~n~2) (= (select .cse17 .cse26) 0) .cse15 .cse16 (exists ((main_~length~6 Int) (v_main_~nondetString2~6.offset_BEFORE_CALL_9 Int)) (and (<= 1 main_~length~6) (<= (+ main_~length~6 v_main_~nondetString2~6.offset_BEFORE_CALL_9) (select |#length| cstrlcpy_~s~2.base)) (<= cstrlcpy_~s~2.offset v_main_~nondetString2~6.offset_BEFORE_CALL_9) (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) (+ main_~length~6 v_main_~nondetString2~6.offset_BEFORE_CALL_9 (- 1)))))) .cse18 .cse19 .cse20 .cse25) .cse2 .cse4 .cse5 .cse6 (not (= (select .cse3 .cse26) 0)) (let ((.cse27 (+ cstrlcpy_~n~2 1))) (and (= cstrlcpy_~d~2.offset 1) (<= .cse27 .cse11) .cse12 .cse22 (<= .cse11 .cse27) (<= 1 cstrlcpy_~s~2.offset) .cse15 (not (= 0 (mod (+ .cse11 4294967295) 4294967296))) .cse23 .cse18 .cse24 .cse19 .cse20 .cse25)) .cse7 .cse8 .cse9))))) [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 554) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L552(lines 552 557) no Hoare annotation was computed. [2018-01-24 16:49:18,891 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 556) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point cstrlcpyEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point L555''''(lines 555 556) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr6RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 575) the Hoare annotation is: true [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 575) the Hoare annotation is: true [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,892 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L571'(line 571) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L566'(lines 566 568) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L570'''(line 570) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L401 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-01-24 16:49:18,893 INFO L397 ceAbstractionStarter]: At program point L572(line 572) the Hoare annotation is: (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|))) (= 0 |main_#t~malloc10.offset|) (= 0 |main_#t~malloc11.offset|) (= (select |#valid| main_~nondetString1~6.base) 1) (= main_~length~6 (select |#length| main_~nondetString2~6.base)) (not (= |main_#t~malloc11.base| main_~nondetString1~6.base)) (exists ((main_~length~6 Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= (+ main_~nondetString2~6.offset main_~length~6) (select |#length| main_~nondetString2~6.base)))) (exists ((main_~nondetString2~6.offset Int)) (and (= (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset (select |#length| main_~nondetString2~6.base) (- 1))) 0) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))) (= 0 main_~nondetString2~6.offset) (<= main_~n~6 2147483647) (= main_~n~6 (select |#length| main_~nondetString1~6.base)) (not (= main_~nondetString2~6.base main_~nondetString1~6.base)) (= 1 (select |#valid| main_~nondetString2~6.base)) (= main_~length~6 (select |#length| |main_#t~malloc11.base|)) (or (< 1 main_~n~6) (= main_~n~6 1)) (= main_~n~6 (select |#length| |main_#t~malloc10.base|)) (= main_~nondetString1~6.offset 0) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|))) [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 560 575) no Hoare annotation was computed. [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 560 575) no Hoare annotation was computed. [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 560 575) no Hoare annotation was computed. [2018-01-24 16:49:18,894 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 560 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point L563''(lines 563 565) no Hoare annotation was computed. [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point L569''(line 569) no Hoare annotation was computed. [2018-01-24 16:49:18,894 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-24 16:49:18,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,927 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,928 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,928 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,928 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,928 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,929 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,929 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,940 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,940 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,940 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,940 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,941 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,941 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,941 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:49:18 BoogieIcfgContainer [2018-01-24 16:49:18,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:49:18,948 INFO L168 Benchmark]: Toolchain (without parser) took 44852.75 ms. Allocated memory was 303.0 MB in the beginning and 725.1 MB in the end (delta: 422.1 MB). Free memory was 262.1 MB in the beginning and 617.3 MB in the end (delta: -355.2 MB). Peak memory consumption was 383.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:49:18,949 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:49:18,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.14 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:49:18,950 INFO L168 Benchmark]: Boogie Preprocessor took 36.34 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 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:49:18,950 INFO L168 Benchmark]: RCFGBuilder took 265.62 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 229.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:49:18,950 INFO L168 Benchmark]: TraceAbstraction took 44345.74 ms. Allocated memory was 303.0 MB in the beginning and 725.1 MB in the end (delta: 422.1 MB). Free memory was 229.5 MB in the beginning and 617.3 MB in the end (delta: -387.8 MB). Peak memory consumption was 351.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:49:18,952 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 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.14 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.34 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 265.62 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 229.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44345.74 ms. Allocated memory was 303.0 MB in the beginning and 725.1 MB in the end (delta: 422.1 MB). Free memory was 229.5 MB in the beginning and 617.3 MB in the end (delta: -387.8 MB). Peak memory consumption was 351.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 267 LocStat_NO_SUPPORTING_DISEQUALITIES : 45 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.815886 RENAME_VARIABLES(MILLISECONDS) : 0.460716 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.766751 PROJECTAWAY(MILLISECONDS) : 0.247337 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001623 DISJOIN(MILLISECONDS) : 0.664674 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.497213 ADD_EQUALITY(MILLISECONDS) : 0.052883 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.033205 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 269 LocStat_NO_SUPPORTING_DISEQUALITIES : 45 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.241448 RENAME_VARIABLES(MILLISECONDS) : 0.396871 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.582053 PROJECTAWAY(MILLISECONDS) : 0.057301 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001083 DISJOIN(MILLISECONDS) : 0.638677 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.431374 ADD_EQUALITY(MILLISECONDS) : 0.021056 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014821 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 346 LocStat_NO_SUPPORTING_DISEQUALITIES : 65 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.847091 RENAME_VARIABLES(MILLISECONDS) : 0.445732 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.796087 PROJECTAWAY(MILLISECONDS) : 0.438481 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001213 DISJOIN(MILLISECONDS) : 0.444651 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.482016 ADD_EQUALITY(MILLISECONDS) : 0.024378 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012073 #CONJOIN_DISJUNCTIVE : 56 #RENAME_VARIABLES : 88 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 85 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 365 LocStat_NO_SUPPORTING_DISEQUALITIES : 68 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 : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.448050 RENAME_VARIABLES(MILLISECONDS) : 0.249342 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.417764 PROJECTAWAY(MILLISECONDS) : 0.144209 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001235 DISJOIN(MILLISECONDS) : 0.503838 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.278019 ADD_EQUALITY(MILLISECONDS) : 0.021044 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010891 #CONJOIN_DISJUNCTIVE : 94 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 156 #PROJECTAWAY : 118 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 80 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 387 LocStat_NO_SUPPORTING_DISEQUALITIES : 72 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 78 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.398993 RENAME_VARIABLES(MILLISECONDS) : 0.225444 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.368896 PROJECTAWAY(MILLISECONDS) : 0.155784 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001198 DISJOIN(MILLISECONDS) : 0.242875 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.255894 ADD_EQUALITY(MILLISECONDS) : 0.018636 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013710 #CONJOIN_DISJUNCTIVE : 111 #RENAME_VARIABLES : 194 #UNFREEZE : 0 #CONJOIN : 177 #PROJECTAWAY : 138 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 189 #ADD_EQUALITY : 82 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_9,QUANTIFIED] [2018-01-24 16:49:18,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:49:18,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 16:49:18,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:49:18,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:49:18,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((dst == src || !(0 == dst)) || !(1 == \valid[src])) || !(\old(unknown-#memory_int-unknown)[src][src] == 0)) || 2147483647 < \old(siz)) || !(\valid[dst] == 1)) || !(unknown-#length-unknown[dst] == \old(siz))) || !(0 == src)) || !(\exists v_main_~nondetString2~6.offset_BEFORE_CALL_2 : int, main_~length~6 : int :: ((0 == \old(unknown-#memory_int-unknown)[src][v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 + -1] && 1 <= main_~length~6) && src <= v_main_~nondetString2~6.offset_BEFORE_CALL_2) && v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 <= unknown-#length-unknown[src])) || unknown-#length-unknown[dst] < 1) || (((((((((((n <= 2147483647 && unknown-#length-unknown[d] == n) && 1 <= siz) && 0 == s) && 0 == unknown-#memory_int-unknown[s][s]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 0 == d) && 0 == unknown-#memory_int-unknown[src][src]) && 1 == \valid[d]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0)) && ((((((((((((dst == src || ((((((((((((unknown-#length-unknown[d] <= n + d && 1 <= d) && n + d <= unknown-#length-unknown[d]) && 1 <= siz) && !(d == s)) && 2 <= s) && 1 == \valid[s]) && 1 <= n) && n / 4294967296 <= 0) && 1 == \valid[d]) && s + 1 <= unknown-#length-unknown[s]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(0 == dst)) || (((((((((((((n <= 2147483647 && 1 <= siz) && n <= unknown-#length-unknown[d]) && !(d == s)) && 0 == s) && unknown-#length-unknown[d] <= n) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 1 == \valid[s]) && 0 == d) && (\exists main_~length~6 : int, v_main_~nondetString2~6.offset_BEFORE_CALL_9 : int :: ((1 <= main_~length~6 && main_~length~6 + v_main_~nondetString2~6.offset_BEFORE_CALL_9 <= unknown-#length-unknown[s]) && s <= v_main_~nondetString2~6.offset_BEFORE_CALL_9) && 0 == unknown-#memory_int-unknown[s][main_~length~6 + v_main_~nondetString2~6.offset_BEFORE_CALL_9 + -1])) && 1 == \valid[d]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(1 == \valid[src])) || 2147483647 < \old(siz)) || !(\valid[dst] == 1)) || !(unknown-#length-unknown[dst] == \old(siz))) || !(\old(unknown-#memory_int-unknown)[src][unknown-#length-unknown[src] + -1] == 0)) || (((((((((((((d == 1 && n + 1 <= unknown-#length-unknown[d]) && 1 <= siz) && !(d == s)) && unknown-#length-unknown[d] <= n + 1) && 1 <= s) && 1 == \valid[s]) && !(0 == (unknown-#length-unknown[d] + 4294967295) % 4294967296)) && n / 4294967296 <= 0) && 1 == \valid[d]) && s + 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(0 == src)) || !(\exists v_main_~nondetString2~6.offset_BEFORE_CALL_2 : int, main_~length~6 : int :: ((0 == \old(unknown-#memory_int-unknown)[src][v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 + -1] && 1 <= main_~length~6) && src <= v_main_~nondetString2~6.offset_BEFORE_CALL_2) && v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 <= unknown-#length-unknown[src])) || unknown-#length-unknown[dst] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. SAFE Result, 44.2s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1071 SDtfs, 1956 SDslu, 5859 SDs, 0 SdLazy, 5370 SolverSat, 439 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1763 GetRequests, 965 SyntacticMatches, 64 SemanticMatches, 734 ConstructedPredicates, 0 IntricatePredicates, 18 DeprecatedPredicates, 9471 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 179 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 800 HoareAnnotationTreeSize, 9 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1489 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1415 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2010 ConstructedInterpolants, 256 QuantifiedInterpolants, 891653 SizeOfPredicates, 409 NumberOfNonLiveVariables, 3568 ConjunctsInSsa, 1080 ConjunctsInUnsatCore, 69 InterpolantComputations, 19 PerfectInterpolantSequences, 28/543 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_16-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_16-49-19-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-49-19-000.csv Received shutdown request...