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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 11:59:56,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 11:59:56,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 11:59:56,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 11:59:56,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 11:59:56,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 11:59:56,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 11:59:56,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 11:59:56,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 11:59:56,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 11:59:56,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 11:59:56,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 11:59:56,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 11:59:56,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 11:59:56,946 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 11:59:56,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 11:59:56,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 11:59:56,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 11:59:56,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 11:59:56,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 11:59:56,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 11:59:56,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 11:59:56,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 11:59:56,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 11:59:56,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 11:59:56,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 11:59:56,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 11:59:56,958 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 11:59:56,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 11:59:56,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 11:59:56,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 11:59:56,959 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 11:59:56,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 11:59:56,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 11:59:56,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 11:59:56,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 11:59:56,969 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 11:59:56,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 11:59:56,970 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 11:59:56,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 11:59:56,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 11:59:56,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 11:59:56,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 11:59:56,972 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 11:59:56,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 11:59:56,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 11:59:57,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 11:59:57,011 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 11:59:57,014 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 11:59:57,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 11:59:57,016 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 11:59:57,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 11:59:57,168 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 11:59:57,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 11:59:57,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 11:59:57,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 11:59:57,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 11:59:57,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbca3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57, skipping insertion in model container [2018-02-04 11:59:57,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,192 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 11:59:57,228 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 11:59:57,322 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 11:59:57,334 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 11:59:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57 WrapperNode [2018-02-04 11:59:57,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 11:59:57,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 11:59:57,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 11:59:57,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 11:59:57,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... [2018-02-04 11:59:57,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 11:59:57,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 11:59:57,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 11:59:57,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 11:59:57,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 11:59:57,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 11:59:57,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 11:59:57,410 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-02-04 11:59:57,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 11:59:57,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 11:59:57,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 11:59:57,562 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 11:59:57,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 11:59:57 BoogieIcfgContainer [2018-02-04 11:59:57,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 11:59:57,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 11:59:57,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 11:59:57,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 11:59:57,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 11:59:57" (1/3) ... [2018-02-04 11:59:57,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348968b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 11:59:57, skipping insertion in model container [2018-02-04 11:59:57,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:57" (2/3) ... [2018-02-04 11:59:57,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348968b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 11:59:57, skipping insertion in model container [2018-02-04 11:59:57,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 11:59:57" (3/3) ... [2018-02-04 11:59:57,566 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 11:59:57,572 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 11:59:57,577 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 11:59:57,599 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 11:59:57,599 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 11:59:57,599 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 11:59:57,599 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 11:59:57,599 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 11:59:57,599 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 11:59:57,599 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 11:59:57,600 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 11:59:57,600 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 11:59:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-04 11:59:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 11:59:57,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:57,619 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:57,620 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 104454547, now seen corresponding path program 1 times [2018-02-04 11:59:57,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:57,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:57,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:57,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:57,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:57,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:57,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:57,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 11:59:57,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 11:59:57,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 11:59:57,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 11:59:57,799 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-02-04 11:59:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:57,879 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 11:59:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 11:59:57,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 11:59:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:57,936 INFO L225 Difference]: With dead ends: 50 [2018-02-04 11:59:57,937 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 11:59:57,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 11:59:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 11:59:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 11:59:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 11:59:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-04 11:59:57,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11 [2018-02-04 11:59:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:57,965 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-04 11:59:57,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 11:59:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-04 11:59:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 11:59:57,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:57,966 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:57,966 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224676, now seen corresponding path program 1 times [2018-02-04 11:59:57,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:57,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:57,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:57,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:57,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:57,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 11:59:58,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 11:59:58,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 11:59:58,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 11:59:58,079 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-02-04 11:59:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,199 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-04 11:59:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 11:59:58,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 11:59:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,208 INFO L225 Difference]: With dead ends: 45 [2018-02-04 11:59:58,208 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 11:59:58,209 INFO L554 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-02-04 11:59:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 11:59:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 11:59:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 11:59:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 11:59:58,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-02-04 11:59:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,214 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 11:59:58,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 11:59:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 11:59:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 11:59:58,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,214 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,214 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224677, now seen corresponding path program 1 times [2018-02-04 11:59:58,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 11:59:58,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 11:59:58,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 11:59:58,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 11:59:58,326 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 11:59:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,379 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 11:59:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 11:59:58,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 11:59:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,380 INFO L225 Difference]: With dead ends: 44 [2018-02-04 11:59:58,380 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 11:59:58,381 INFO L554 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-02-04 11:59:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 11:59:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 11:59:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 11:59:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 11:59:58,384 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2018-02-04 11:59:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,385 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 11:59:58,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 11:59:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 11:59:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 11:59:58,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,385 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,385 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193927, now seen corresponding path program 1 times [2018-02-04 11:59:58,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 11:59:58,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 11:59:58,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 11:59:58,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 11:59:58,433 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-02-04 11:59:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,469 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 11:59:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 11:59:58,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 11:59:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,469 INFO L225 Difference]: With dead ends: 43 [2018-02-04 11:59:58,469 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 11:59:58,470 INFO L554 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-02-04 11:59:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 11:59:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 11:59:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 11:59:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 11:59:58,472 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-02-04 11:59:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,472 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 11:59:58,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 11:59:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 11:59:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 11:59:58,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,473 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,473 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193928, now seen corresponding path program 1 times [2018-02-04 11:59:58,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 11:59:58,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 11:59:58,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 11:59:58,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 11:59:58,526 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-02-04 11:59:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,638 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 11:59:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 11:59:58,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 11:59:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,641 INFO L225 Difference]: With dead ends: 58 [2018-02-04 11:59:58,641 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 11:59:58,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 11:59:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 11:59:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-02-04 11:59:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 11:59:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 11:59:58,653 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-02-04 11:59:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,653 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 11:59:58,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 11:59:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 11:59:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 11:59:58,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,654 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,654 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 659847302, now seen corresponding path program 1 times [2018-02-04 11:59:58,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 11:59:58,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 11:59:58,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 11:59:58,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 11:59:58,727 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-04 11:59:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,796 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 11:59:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 11:59:58,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 11:59:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,797 INFO L225 Difference]: With dead ends: 49 [2018-02-04 11:59:58,797 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 11:59:58,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 11:59:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 11:59:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-04 11:59:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 11:59:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 11:59:58,801 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2018-02-04 11:59:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,801 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 11:59:58,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 11:59:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 11:59:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 11:59:58,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,802 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,802 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -262056781, now seen corresponding path program 1 times [2018-02-04 11:59:58,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 11:59:58,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 11:59:58,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 11:59:58,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 11:59:58,845 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-02-04 11:59:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:58,878 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 11:59:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 11:59:58,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 11:59:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:58,879 INFO L225 Difference]: With dead ends: 41 [2018-02-04 11:59:58,879 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 11:59:58,880 INFO L554 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-02-04 11:59:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 11:59:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 11:59:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 11:59:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 11:59:58,882 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-04 11:59:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:58,883 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 11:59:58,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 11:59:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 11:59:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 11:59:58,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:58,883 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:58,884 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -262056780, now seen corresponding path program 1 times [2018-02-04 11:59:58,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:58,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:58,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,885 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:58,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:58,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:58,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:58,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 11:59:58,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 11:59:58,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 11:59:58,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 11:59:58,948 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-02-04 11:59:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:59,050 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 11:59:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 11:59:59,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 11:59:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:59,050 INFO L225 Difference]: With dead ends: 46 [2018-02-04 11:59:59,050 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 11:59:59,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 11:59:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 11:59:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-04 11:59:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 11:59:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 11:59:59,052 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2018-02-04 11:59:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:59,053 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 11:59:59,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 11:59:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 11:59:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 11:59:59,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:59,053 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:59,053 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1316966177, now seen corresponding path program 1 times [2018-02-04 11:59:59,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:59,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:59,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:59,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:59,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:59,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 11:59:59,142 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 11:59:59,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:59,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 11:59:59,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 11:59:59,212 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-02-04 11:59:59,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 11:59:59,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 11:59:59,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 11:59:59,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:59,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 11:59:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:59,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 11:59:59,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-02-04 11:59:59,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 11:59:59,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 11:59:59,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 11:59:59,304 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-02-04 11:59:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:59,590 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 11:59:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 11:59:59,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-04 11:59:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:59,592 INFO L225 Difference]: With dead ends: 88 [2018-02-04 11:59:59,592 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 11:59:59,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-04 11:59:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 11:59:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-02-04 11:59:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 11:59:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 11:59:59,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2018-02-04 11:59:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:59,596 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 11:59:59,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 11:59:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 11:59:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 11:59:59,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:59,597 INFO L351 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] [2018-02-04 11:59:59,597 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766212, now seen corresponding path program 1 times [2018-02-04 11:59:59,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:59,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:59,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:59,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:59,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:59,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:59,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 11:59:59,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 11:59:59,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 11:59:59,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 11:59:59,652 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-02-04 11:59:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:59,703 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-04 11:59:59,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 11:59:59,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 11:59:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:59,705 INFO L225 Difference]: With dead ends: 57 [2018-02-04 11:59:59,705 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 11:59:59,705 INFO L554 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-02-04 11:59:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 11:59:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 11:59:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 11:59:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-02-04 11:59:59,709 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24 [2018-02-04 11:59:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:59,709 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-02-04 11:59:59,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 11:59:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-02-04 11:59:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 11:59:59,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:59,710 INFO L351 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] [2018-02-04 11:59:59,710 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766211, now seen corresponding path program 1 times [2018-02-04 11:59:59,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:59,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:59,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:59,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:59,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:59,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:59,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 11:59:59,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 11:59:59,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 11:59:59,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 11:59:59,789 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2018-02-04 11:59:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:59,861 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 11:59:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 11:59:59,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 11:59:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:59,862 INFO L225 Difference]: With dead ends: 64 [2018-02-04 11:59:59,862 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 11:59:59,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 11:59:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 11:59:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 11:59:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 11:59:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-02-04 11:59:59,866 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 24 [2018-02-04 11:59:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:59,866 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-02-04 11:59:59,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 11:59:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-02-04 11:59:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 11:59:59,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:59,867 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:59,867 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 11:59:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243135, now seen corresponding path program 1 times [2018-02-04 11:59:59,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:59,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:59,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:59,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:59,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:59,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:59,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 11:59:59,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 11:59:59,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 11:59:59,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 11:59:59,938 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-02-04 11:59:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:00,000 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 12:00:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:00:00,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 12:00:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:00,001 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:00:00,001 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:00:00,001 INFO L554 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-02-04 12:00:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:00:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 12:00:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 12:00:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-02-04 12:00:00,003 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 25 [2018-02-04 12:00:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:00,003 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-02-04 12:00:00,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:00:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-02-04 12:00:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:00:00,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:00,004 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:00,004 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243134, now seen corresponding path program 1 times [2018-02-04 12:00:00,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:00,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:00,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:00,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:00,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:00,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:00:00,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:00:00,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:00:00,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:00:00,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:00:00,125 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states. [2018-02-04 12:00:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:00,197 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 12:00:00,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:00:00,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 12:00:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:00,198 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:00:00,198 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 12:00:00,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:00:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 12:00:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-04 12:00:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 12:00:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-02-04 12:00:00,200 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 25 [2018-02-04 12:00:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:00,200 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-02-04 12:00:00,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:00:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-02-04 12:00:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:00:00,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:00,201 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:00,201 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1513907666, now seen corresponding path program 1 times [2018-02-04 12:00:00,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:00,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:00,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,202 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:00,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:00,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:00:00,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:00:00,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:00:00,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:00:00,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:00:00,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:00:00,285 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2018-02-04 12:00:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:00,429 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-02-04 12:00:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:00:00,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-04 12:00:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:00,430 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:00:00,430 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 12:00:00,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:00:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 12:00:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-02-04 12:00:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:00:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-02-04 12:00:00,433 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-02-04 12:00:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:00,433 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-02-04 12:00:00,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:00:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-02-04 12:00:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:00:00,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:00,434 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:00,434 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -175036076, now seen corresponding path program 1 times [2018-02-04 12:00:00,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:00,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:00,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:00,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:00,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:00,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:00,614 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:00,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:00,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:00,664 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-02-04 12:00:00,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:00,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:00,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:00:00,712 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-02-04 12:00:00,714 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-02-04 12:00:00,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:00,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:00,723 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-02-04 12:00:00,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:00:00,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:00:00,828 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 14 treesize of output 11 [2018-02-04 12:00:00,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:00,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:00,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:00,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-02-04 12:00:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:00,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:00,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 12:00:00,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:00:00,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:00:00,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:00:00,941 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 21 states. [2018-02-04 12:00:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:01,429 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 12:00:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:00:01,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-02-04 12:00:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:01,430 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:00:01,430 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:00:01,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:00:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:00:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-02-04 12:00:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 12:00:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-02-04 12:00:01,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-02-04 12:00:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:01,434 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-02-04 12:00:01,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:00:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-02-04 12:00:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:00:01,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:01,435 INFO L351 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] [2018-02-04 12:00:01,435 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -707331403, now seen corresponding path program 1 times [2018-02-04 12:00:01,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:01,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:01,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:01,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:01,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:01,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:01,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:01,502 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:01,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:01,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:01,541 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-02-04 12:00:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:01,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:01,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 12:00:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:01,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:01,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-02-04 12:00:01,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:00:01,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:00:01,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:00:01,680 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 15 states. [2018-02-04 12:00:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:02,140 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-02-04 12:00:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:00:02,140 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-04 12:00:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:02,140 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:00:02,141 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:00:02,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:00:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:00:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-02-04 12:00:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:00:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-02-04 12:00:02,144 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 28 [2018-02-04 12:00:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:02,144 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-02-04 12:00:02,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:00:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-02-04 12:00:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:00:02,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:02,145 INFO L351 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] [2018-02-04 12:00:02,145 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -653260906, now seen corresponding path program 1 times [2018-02-04 12:00:02,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:02,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:02,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:02,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:02,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:02,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:02,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:00:02,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 12:00:02,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:00:02,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:00:02,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:00:02,376 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 15 states. [2018-02-04 12:00:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:02,810 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-02-04 12:00:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:00:02,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-04 12:00:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:02,811 INFO L225 Difference]: With dead ends: 161 [2018-02-04 12:00:02,811 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 12:00:02,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:00:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 12:00:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2018-02-04 12:00:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 12:00:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2018-02-04 12:00:02,816 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 29 [2018-02-04 12:00:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:02,816 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2018-02-04 12:00:02,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:00:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2018-02-04 12:00:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:00:02,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:02,817 INFO L351 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] [2018-02-04 12:00:02,817 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash -434406188, now seen corresponding path program 1 times [2018-02-04 12:00:02,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:02,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:02,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:02,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:02,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:02,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:03,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:03,007 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:03,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:03,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:03,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-04 12:00:03,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:00:03,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:03,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:03,086 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-02-04 12:00:03,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:00:03,118 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-02-04 12:00:03,120 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-02-04 12:00:03,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,125 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-02-04 12:00:03,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:00:03,143 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 25 treesize of output 26 [2018-02-04 12:00:03,145 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-02-04 12:00:03,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,153 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-02-04 12:00:03,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:00:03,323 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 30 treesize of output 28 [2018-02-04 12:00:03,327 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 8 treesize of output 1 [2018-02-04 12:00:03,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:03,339 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-02-04 12:00:03,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:03,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:03,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:03,355 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-04 12:00:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:03,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:03,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-04 12:00:03,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:00:03,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:00:03,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:00:03,430 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand 24 states. [2018-02-04 12:00:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:04,146 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2018-02-04 12:00:04,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:00:04,147 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-02-04 12:00:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:04,147 INFO L225 Difference]: With dead ends: 143 [2018-02-04 12:00:04,148 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 12:00:04,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:00:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 12:00:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-02-04 12:00:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 12:00:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-02-04 12:00:04,152 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 29 [2018-02-04 12:00:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:04,152 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-02-04 12:00:04,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:00:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-02-04 12:00:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:00:04,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:04,153 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:04,153 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -409487743, now seen corresponding path program 2 times [2018-02-04 12:00:04,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:04,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:04,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:04,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:04,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:04,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:04,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:04,569 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:04,573 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:00:04,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:00:04,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:04,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:04,611 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-02-04 12:00:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:04,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:04,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:00:04,645 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-02-04 12:00:04,647 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-02-04 12:00:04,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:04,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:04,651 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-02-04 12:00:04,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:00:04,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 12:00:04,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:04,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 12:00:04,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:04,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:04,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:04,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-02-04 12:00:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:04,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:04,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-02-04 12:00:04,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:00:04,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:00:04,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:00:04,863 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 30 states. [2018-02-04 12:00:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:05,409 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2018-02-04 12:00:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:00:05,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-02-04 12:00:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:05,412 INFO L225 Difference]: With dead ends: 180 [2018-02-04 12:00:05,412 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 12:00:05,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:00:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 12:00:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2018-02-04 12:00:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 12:00:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-02-04 12:00:05,416 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 29 [2018-02-04 12:00:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:05,416 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-02-04 12:00:05,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:00:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-02-04 12:00:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:00:05,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:05,418 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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-02-04 12:00:05,418 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1617883298, now seen corresponding path program 2 times [2018-02-04 12:00:05,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:05,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:05,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:05,419 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:05,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:05,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:05,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:05,506 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:05,511 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:00:05,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:00:05,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:05,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:00:05,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:00:05,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-02-04 12:00:05,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:00:05,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:00:05,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:00:05,556 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 12 states. [2018-02-04 12:00:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:05,674 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-02-04 12:00:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:00:05,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 12:00:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:05,675 INFO L225 Difference]: With dead ends: 154 [2018-02-04 12:00:05,675 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 12:00:05,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:00:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 12:00:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2018-02-04 12:00:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 12:00:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-02-04 12:00:05,678 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 31 [2018-02-04 12:00:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:05,678 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-02-04 12:00:05,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:00:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-02-04 12:00:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:00:05,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:05,679 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:05,679 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1342276044, now seen corresponding path program 3 times [2018-02-04 12:00:05,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:05,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:05,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:05,680 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:05,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:05,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:05,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:05,994 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:05,998 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:00:06,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 12:00:06,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:06,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:06,036 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-02-04 12:00:06,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:06,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:06,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:00:06,093 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-02-04 12:00:06,095 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-02-04 12:00:06,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:06,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:06,102 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-02-04 12:00:06,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:00:06,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-02-04 12:00:06,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 55 [2018-02-04 12:00:06,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-04 12:00:06,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:06,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:06,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-02-04 12:00:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:06,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:06,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-02-04 12:00:06,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:00:06,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:00:06,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:00:06,491 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 34 states. [2018-02-04 12:00:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:07,393 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-02-04 12:00:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:00:07,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-02-04 12:00:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:07,394 INFO L225 Difference]: With dead ends: 185 [2018-02-04 12:00:07,394 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 12:00:07,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=2186, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:00:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 12:00:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2018-02-04 12:00:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 12:00:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-02-04 12:00:07,398 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 32 [2018-02-04 12:00:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:07,398 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-02-04 12:00:07,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:00:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-02-04 12:00:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:00:07,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:07,399 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:07,399 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 785498486, now seen corresponding path program 1 times [2018-02-04 12:00:07,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:07,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:07,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:07,400 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:07,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:07,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:07,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:07,624 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:07,629 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:07,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:07,660 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-02-04 12:00:07,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,664 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-02-04 12:00:07,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-02-04 12:00:07,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:07,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:07,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:00:07,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:07,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:07,706 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-02-04 12:00:07,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:07,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-04 12:00:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:07,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:07,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-04 12:00:07,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:00:07,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:00:07,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:00:07,948 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 28 states. [2018-02-04 12:00:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:08,513 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-02-04 12:00:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:00:08,513 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-02-04 12:00:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:08,514 INFO L225 Difference]: With dead ends: 188 [2018-02-04 12:00:08,514 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 12:00:08,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:00:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 12:00:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 151. [2018-02-04 12:00:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 12:00:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-02-04 12:00:08,519 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 33 [2018-02-04 12:00:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:08,519 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-02-04 12:00:08,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:00:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-02-04 12:00:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:00:08,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:08,520 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 12:00:08,521 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1281886369, now seen corresponding path program 2 times [2018-02-04 12:00:08,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:08,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:08,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:08,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:08,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:08,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:08,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:08,840 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:08,844 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:00:08,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:00:08,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:08,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:08,864 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-02-04 12:00:08,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,868 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-02-04 12:00:08,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:00:08,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:08,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:08,877 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-02-04 12:00:08,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,882 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-02-04 12:00:08,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:00:08,912 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-02-04 12:00:08,913 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-02-04 12:00:08,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-02-04 12:00:08,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 12:00:08,944 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-02-04 12:00:08,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:08,953 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-02-04 12:00:08,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-02-04 12:00:09,075 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 33 treesize of output 32 [2018-02-04 12:00:09,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-02-04 12:00:09,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:09,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:09,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 12:00:09,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-02-04 12:00:09,154 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-02-04 12:00:09,158 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-02-04 12:00:09,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:09,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:09,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:09,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-02-04 12:00:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:09,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:09,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-04 12:00:09,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:00:09,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:00:09,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:00:09,254 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 29 states. [2018-02-04 12:00:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:09,800 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2018-02-04 12:00:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:00:09,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-02-04 12:00:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:09,801 INFO L225 Difference]: With dead ends: 173 [2018-02-04 12:00:09,801 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 12:00:09,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:00:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 12:00:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-02-04 12:00:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 12:00:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-02-04 12:00:09,804 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 34 [2018-02-04 12:00:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:09,804 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-02-04 12:00:09,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:00:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-02-04 12:00:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:00:09,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:09,805 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:09,805 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 304009148, now seen corresponding path program 1 times [2018-02-04 12:00:09,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:09,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:09,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:09,807 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:09,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:09,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:09,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:00:09,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:00:09,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:00:09,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:00:09,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:00:09,865 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 6 states. [2018-02-04 12:00:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:09,926 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2018-02-04 12:00:09,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:00:09,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 12:00:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:09,927 INFO L225 Difference]: With dead ends: 160 [2018-02-04 12:00:09,927 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:00:09,927 INFO L554 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-02-04 12:00:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:00:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-04 12:00:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 12:00:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-02-04 12:00:09,929 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 35 [2018-02-04 12:00:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:09,929 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-02-04 12:00:09,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:00:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-02-04 12:00:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:00:09,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:09,930 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:09,930 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1600146015, now seen corresponding path program 4 times [2018-02-04 12:00:09,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:09,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:09,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:09,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:00:09,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:09,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:10,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:10,410 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:10,415 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:00:10,427 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:00:10,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:10,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:10,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:00:10,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:10,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:10,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:00:10,481 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-02-04 12:00:10,482 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-02-04 12:00:10,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:10,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:10,487 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-02-04 12:00:10,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:00:10,787 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 48 treesize of output 38 [2018-02-04 12:00:10,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:10,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-02-04 12:00:10,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:10,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:10,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:10,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-02-04 12:00:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:10,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:10,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2018-02-04 12:00:10,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:00:10,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:00:10,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:00:10,965 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 38 states. [2018-02-04 12:00:11,615 WARN L146 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 68 DAG size of output 39 [2018-02-04 12:00:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:13,136 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-02-04 12:00:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:00:13,136 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 35 [2018-02-04 12:00:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:13,136 INFO L225 Difference]: With dead ends: 150 [2018-02-04 12:00:13,137 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 12:00:13,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=2806, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 12:00:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 12:00:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-02-04 12:00:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 12:00:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-04 12:00:13,139 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 35 [2018-02-04 12:00:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:13,139 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-04 12:00:13,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:00:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-04 12:00:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:00:13,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:13,140 INFO L351 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] [2018-02-04 12:00:13,140 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1381463977, now seen corresponding path program 2 times [2018-02-04 12:00:13,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:13,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:13,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:13,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:13,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:13,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:13,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:13,424 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:13,432 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:00:13,450 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:00:13,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:13,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:13,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 6 treesize of output 5 [2018-02-04 12:00:13,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,463 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-02-04 12:00:13,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,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-02-04 12:00:13,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 12:00:13,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:13,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:13,509 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-02-04 12:00:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:13,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:00:13,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-04 12:00:13,559 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-02-04 12:00:13,560 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-02-04 12:00:13,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:13,567 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-02-04 12:00:13,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 12:00:13,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:00:13,636 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 14 treesize of output 15 [2018-02-04 12:00:13,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:13,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:13,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:13,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2018-02-04 12:00:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:13,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:13,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-04 12:00:13,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:00:13,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:00:13,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:00:13,810 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 33 states. [2018-02-04 12:00:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:14,641 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-02-04 12:00:14,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:00:14,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2018-02-04 12:00:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:14,642 INFO L225 Difference]: With dead ends: 165 [2018-02-04 12:00:14,642 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 12:00:14,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=2224, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:00:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 12:00:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2018-02-04 12:00:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 12:00:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-04 12:00:14,644 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 36 [2018-02-04 12:00:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:14,645 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-04 12:00:14,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:00:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-04 12:00:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:00:14,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:14,645 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:14,645 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 269048756, now seen corresponding path program 3 times [2018-02-04 12:00:14,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:14,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:14,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:14,646 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:14,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:14,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:00:14,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:14,941 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:14,949 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:00:14,973 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 12:00:14,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:14,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:14,980 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-02-04 12:00:14,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:14,984 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-02-04 12:00:14,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:14,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:14,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:00:14,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:14,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:14,994 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-02-04 12:00:14,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,000 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-02-04 12:00:15,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:00:15,012 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-02-04 12:00:15,013 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-02-04 12:00:15,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 12:00:15,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-02-04 12:00:15,035 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-02-04 12:00:15,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,040 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-02-04 12:00:15,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-04 12:00:15,121 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 33 treesize of output 32 [2018-02-04 12:00:15,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-02-04 12:00:15,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:15,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:15,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:00:15,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-02-04 12:00:15,206 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-02-04 12:00:15,207 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-02-04 12:00:15,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:15,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 12:00:15,242 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-02-04 12:00:15,247 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-02-04 12:00:15,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:15,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:15,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:15,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-04 12:00:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:00:15,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:15,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2018-02-04 12:00:15,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:00:15,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:00:15,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:00:15,310 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 26 states. [2018-02-04 12:00:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:15,995 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-04 12:00:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:00:15,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-02-04 12:00:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:15,996 INFO L225 Difference]: With dead ends: 125 [2018-02-04 12:00:15,996 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:00:15,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:00:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:00:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-02-04 12:00:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:00:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-04 12:00:15,999 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 39 [2018-02-04 12:00:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:15,999 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-04 12:00:15,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:00:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-04 12:00:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:00:16,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:16,000 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-02-04 12:00:16,000 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 394604694, now seen corresponding path program 3 times [2018-02-04 12:00:16,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:16,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:16,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:16,001 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:16,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:16,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:16,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:16,556 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:16,561 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:00:16,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 12:00:16,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:16,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:16,599 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-02-04 12:00:16,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,604 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-02-04 12:00:16,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:00:16,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:16,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:16,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:00:16,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:16,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:16,663 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-02-04 12:00:16,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-04 12:00:16,726 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-02-04 12:00:16,729 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-02-04 12:00:16,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:16,754 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-02-04 12:00:16,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-02-04 12:00:16,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 12:00:16,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 29 [2018-02-04 12:00:16,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-04 12:00:16,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:17,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:17,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99 [2018-02-04 12:00:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:17,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:17,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-02-04 12:00:17,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:00:17,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:00:17,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:00:17,345 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 38 states. [2018-02-04 12:00:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:18,341 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-04 12:00:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:00:18,341 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2018-02-04 12:00:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:18,342 INFO L225 Difference]: With dead ends: 101 [2018-02-04 12:00:18,342 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:00:18,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=2597, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:00:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:00:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-04 12:00:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:00:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-04 12:00:18,344 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 39 [2018-02-04 12:00:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:18,344 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-04 12:00:18,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:00:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-04 12:00:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:00:18,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:18,344 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:00:18,344 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash 708041921, now seen corresponding path program 5 times [2018-02-04 12:00:18,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:18,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:18,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:18,345 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:18,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:18,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:19,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:19,348 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:19,360 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:00:19,376 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 12:00:19,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:19,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:19,396 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-02-04 12:00:19,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:19,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:19,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:00:19,439 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-02-04 12:00:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:00:19,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:19,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:19,446 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-02-04 12:00:19,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:00:19,967 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 68 treesize of output 54 [2018-02-04 12:00:19,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:19,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187 [2018-02-04 12:00:19,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:20,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:20,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:20,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-02-04 12:00:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:20,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:20,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45 [2018-02-04 12:00:20,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 12:00:20,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 12:00:20,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:00:20,252 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 46 states. [2018-02-04 12:00:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:24,519 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-02-04 12:00:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:00:24,519 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 41 [2018-02-04 12:00:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:24,519 INFO L225 Difference]: With dead ends: 152 [2018-02-04 12:00:24,519 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 12:00:24,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=704, Invalid=4846, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 12:00:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 12:00:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2018-02-04 12:00:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 12:00:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-02-04 12:00:24,523 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 41 [2018-02-04 12:00:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:24,523 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-02-04 12:00:24,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 12:00:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-02-04 12:00:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:00:24,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:24,524 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2018-02-04 12:00:24,524 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -79154039, now seen corresponding path program 4 times [2018-02-04 12:00:24,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:24,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:24,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:24,525 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:24,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:24,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:25,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:25,445 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:00:25,450 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:00:25,465 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:00:25,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:25,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:25,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-02-04 12:00:25,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,480 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 28 treesize of output 27 [2018-02-04 12:00:25,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,488 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 27 treesize of output 26 [2018-02-04 12:00:25,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,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 18 treesize of output 17 [2018-02-04 12:00:25,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:25,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41 [2018-02-04 12:00:25,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,564 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 27 treesize of output 21 [2018-02-04 12:00:25,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 12:00:25,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 12:00:25,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:25,607 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 36 treesize of output 30 [2018-02-04 12:00:25,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:25,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40 [2018-02-04 12:00:25,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-02-04 12:00:25,683 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 18 treesize of output 17 [2018-02-04 12:00:25,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-02-04 12:00:25,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:00:25,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:25,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:00:25,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-02-04 12:00:26,265 WARN L143 SmtUtils]: Spent 353ms on a formula simplification that was a NOOP. DAG size: 45 [2018-02-04 12:00:26,768 WARN L143 SmtUtils]: Spent 339ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 12:00:27,403 WARN L143 SmtUtils]: Spent 579ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-04 12:00:27,407 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 68 treesize of output 60 [2018-02-04 12:00:27,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-02-04 12:00:27,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:27,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:27,465 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 65 treesize of output 57 [2018-02-04 12:00:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:27,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 79 [2018-02-04 12:00:27,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:27,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:27,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 12:00:27,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278 [2018-02-04 12:00:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:27,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:27,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-02-04 12:00:27,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 12:00:27,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 12:00:27,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1619, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:00:27,871 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 42 states. [2018-02-04 12:00:29,265 WARN L146 SmtUtils]: Spent 1019ms on a formula simplification. DAG size of input: 133 DAG size of output 67 [2018-02-04 12:00:30,958 WARN L146 SmtUtils]: Spent 1643ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-02-04 12:00:32,832 WARN L146 SmtUtils]: Spent 1822ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-04 12:00:39,672 WARN L146 SmtUtils]: Spent 6791ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-02-04 12:00:40,790 WARN L146 SmtUtils]: Spent 1058ms on a formula simplification. DAG size of input: 123 DAG size of output 88 [2018-02-04 12:00:45,249 WARN L146 SmtUtils]: Spent 4175ms on a formula simplification. DAG size of input: 133 DAG size of output 94 [2018-02-04 12:00:49,094 WARN L146 SmtUtils]: Spent 3783ms on a formula simplification. DAG size of input: 118 DAG size of output 102 [2018-02-04 12:00:52,058 WARN L146 SmtUtils]: Spent 2915ms on a formula simplification. DAG size of input: 129 DAG size of output 108 [2018-02-04 12:00:52,674 WARN L146 SmtUtils]: Spent 572ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 12:00:53,662 WARN L146 SmtUtils]: Spent 870ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 12:00:53,870 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-02-04 12:00:55,154 WARN L146 SmtUtils]: Spent 1223ms on a formula simplification. DAG size of input: 92 DAG size of output 78 [2018-02-04 12:00:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:55,765 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-04 12:00:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 12:00:55,765 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-02-04 12:00:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:55,766 INFO L225 Difference]: With dead ends: 139 [2018-02-04 12:00:55,766 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 12:00:55,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=341, Invalid=3949, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 12:00:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 12:00:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-02-04 12:00:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 12:00:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-04 12:00:55,768 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 42 [2018-02-04 12:00:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:55,768 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-04 12:00:55,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 12:00:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-04 12:00:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:00:55,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:55,769 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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] [2018-02-04 12:00:55,769 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash -563034186, now seen corresponding path program 5 times [2018-02-04 12:00:55,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:55,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:55,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:55,769 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:55,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:55,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:00:56,206 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 88 DAG size of output 37 [2018-02-04 12:00:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:57,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:00:57,078 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:00:57,083 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:00:57,100 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 12:00:57,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:00:57,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:00:57,106 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-02-04 12:00:57,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,111 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-02-04 12:00:57,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:25 [2018-02-04 12:00:57,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,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, 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-02-04 12:00:57,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-02-04 12:00:57,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-02-04 12:00:57,228 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-02-04 12:00:57,229 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-02-04 12:00:57,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:00:57,235 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-02-04 12:00:57,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-04 12:00:57,543 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 41 treesize of output 31 [2018-02-04 12:00:57,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:00:57,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2018-02-04 12:00:57,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:00:57,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:57,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:00:57,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:151 [2018-02-04 12:00:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:00:57,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:00:57,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-02-04 12:00:57,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 12:00:57,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 12:00:57,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1782, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:00:57,840 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 44 states. [2018-02-04 12:00:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:00:59,814 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-02-04 12:00:59,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:00:59,814 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2018-02-04 12:00:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:00:59,815 INFO L225 Difference]: With dead ends: 158 [2018-02-04 12:00:59,815 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 12:00:59,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=282, Invalid=3750, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 12:00:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 12:00:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-02-04 12:00:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 12:00:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-04 12:00:59,819 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 45 [2018-02-04 12:00:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:00:59,819 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-04 12:00:59,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 12:00:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-04 12:00:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:00:59,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:00:59,820 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 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] [2018-02-04 12:00:59,820 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:00:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1926248087, now seen corresponding path program 6 times [2018-02-04 12:00:59,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:00:59,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:00:59,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:59,821 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:00:59,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:00:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:00:59,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:01:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:01:00,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:01:00,945 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:01:00,950 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:01:00,984 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 12:01:00,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:01:00,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:01:01,075 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-02-04 12:01:01,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:01:01,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:01:01,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 12:01:01,133 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-02-04 12:01:01,134 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-02-04 12:01:01,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:01:01,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:01:01,147 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-02-04 12:01:01,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 12:01:01,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 57 treesize of output 43 [2018-02-04 12:01:01,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 43 treesize of output 181 [2018-02-04 12:01:01,989 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-02-04 12:01:02,404 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time... Received shutdown request... [2018-02-04 12:03:26,749 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 12:03:26,749 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:03:26,754 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:03:26,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:03:26 BoogieIcfgContainer [2018-02-04 12:03:26,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:03:26,765 INFO L168 Benchmark]: Toolchain (without parser) took 209597.27 ms. Allocated memory was 392.7 MB in the beginning and 614.5 MB in the end (delta: 221.8 MB). Free memory was 349.2 MB in the beginning and 457.5 MB in the end (delta: -108.3 MB). Peak memory consumption was 910.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:26,767 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 392.7 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:03:26,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.27 ms. Allocated memory is still 392.7 MB. Free memory was 349.2 MB in the beginning and 338.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:26,767 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 392.7 MB. Free memory was 338.6 MB in the beginning and 335.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:26,767 INFO L168 Benchmark]: RCFGBuilder took 193.87 ms. Allocated memory is still 392.7 MB. Free memory was 335.9 MB in the beginning and 316.1 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:26,768 INFO L168 Benchmark]: TraceAbstraction took 209201.07 ms. Allocated memory was 392.7 MB in the beginning and 614.5 MB in the end (delta: 221.8 MB). Free memory was 316.1 MB in the beginning and 457.5 MB in the end (delta: -141.3 MB). Peak memory consumption was 877.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:26,769 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 392.7 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.27 ms. Allocated memory is still 392.7 MB. Free memory was 349.2 MB in the beginning and 338.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.10 ms. Allocated memory is still 392.7 MB. Free memory was 338.6 MB in the beginning and 335.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.87 ms. Allocated memory is still 392.7 MB. Free memory was 335.9 MB in the beginning and 316.1 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 209201.07 ms. Allocated memory was 392.7 MB in the beginning and 614.5 MB in the end (delta: 221.8 MB). Free memory was 316.1 MB in the beginning and 457.5 MB in the end (delta: -141.3 MB). Peak memory consumption was 877.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 11 error locations. TIMEOUT Result, 209.1s OverallTime, 32 OverallIterations, 8 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1031 SDtfs, 2633 SDslu, 8520 SDs, 0 SdLazy, 9705 SolverSat, 784 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1213 GetRequests, 369 SyntacticMatches, 16 SemanticMatches, 828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7633 ImplicationChecksByTransitivity, 48.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 427 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1354 ConstructedInterpolants, 119 QuantifiedInterpolants, 739609 SizeOfPredicates, 234 NumberOfNonLiveVariables, 2653 ConjunctsInSsa, 837 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 29/694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-03-26-780.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-03-26-780.csv Completed graceful shutdown