java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:45:08,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:45:08,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:45:08,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:45:08,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:45:08,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:45:08,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:45:08,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:45:08,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:45:08,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:45:08,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:45:08,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:45:08,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:45:08,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:45:08,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:45:08,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:45:08,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:45:08,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:45:08,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:45:08,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:45:08,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:45:08,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:45:08,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:45:08,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:45:08,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:45:08,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:45:08,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:45:08,281 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:45:08,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:45:08,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:45:08,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:45:08,282 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:45:08,294 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:45:08,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:45:08,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:45:08,295 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:45:08,296 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:45:08,296 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:45:08,296 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:45:08,296 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:45:08,296 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:45:08,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:45:08,297 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:45:08,298 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:45:08,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:45:08,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:45:08,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:45:08,299 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:45:08,299 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:45:08,299 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:45:08,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:45:08,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:45:08,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:45:08,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:45:08,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:45:08,300 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:45:08,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:45:08,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:45:08,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:45:08,301 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:45:08,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:45:08,302 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:45:08,303 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:45:08,304 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:45:08,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:45:08,375 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:45:08,380 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:45:08,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:45:08,382 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:45:08,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:45:08,633 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:45:08,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:45:08,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:45:08,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:45:08,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:45:08,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08, skipping insertion in model container [2018-01-25 02:45:08,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,670 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:45:08,712 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:45:08,845 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:45:08,864 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:45:08,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08 WrapperNode [2018-01-25 02:45:08,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:45:08,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:45:08,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:45:08,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:45:08,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... [2018-01-25 02:45:08,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:45:08,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:45:08,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:45:08,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:45:08,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:45:08,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:45:08,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:45:08,968 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 02:45:08,969 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:45:08,969 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:45:08,969 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:45:08,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:45:08,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:45:08,969 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:45:08,970 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:45:08,970 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 02:45:08,970 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:45:08,970 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:45:08,970 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:45:09,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:45:09,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:45:09 BoogieIcfgContainer [2018-01-25 02:45:09,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:45:09,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:45:09,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:45:09,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:45:09,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:45:08" (1/3) ... [2018-01-25 02:45:09,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189240df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:45:09, skipping insertion in model container [2018-01-25 02:45:09,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:08" (2/3) ... [2018-01-25 02:45:09,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189240df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:45:09, skipping insertion in model container [2018-01-25 02:45:09,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:45:09" (3/3) ... [2018-01-25 02:45:09,278 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:45:09,285 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:45:09,292 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:45:09,344 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:45:09,344 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:45:09,344 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:45:09,345 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:45:09,345 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:45:09,345 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:45:09,345 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:45:09,345 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:45:09,346 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:45:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-25 02:45:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:45:09,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:09,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:09,384 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-01-25 02:45:09,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:09,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:09,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:09,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:09,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:09,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:09,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:09,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:45:09,674 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:09,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:45:09,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:45:09,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:45:09,694 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-25 02:45:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:10,016 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-25 02:45:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:45:10,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:45:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:10,027 INFO L225 Difference]: With dead ends: 71 [2018-01-25 02:45:10,027 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:45:10,030 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:45:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:45:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:45:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:45:10,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-25 02:45:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:10,063 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:45:10,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:45:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:45:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:45:10,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:10,063 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:10,064 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-01-25 02:45:10,064 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:10,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:10,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:10,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:10,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:10,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:45:10,199 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:10,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:45:10,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:45:10,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:10,201 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-25 02:45:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:10,282 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-25 02:45:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:10,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:45:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:10,284 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:45:10,284 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:45:10,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:45:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:45:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 02:45:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:45:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-25 02:45:10,293 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-25 02:45:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:10,294 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-25 02:45:10,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:45:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-25 02:45:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:45:10,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:10,294 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:10,294 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-01-25 02:45:10,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:10,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:10,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:10,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:10,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:10,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:45:10,341 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:10,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:45:10,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:45:10,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:45:10,342 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-25 02:45:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:10,448 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 02:45:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:45:10,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:45:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:10,450 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:45:10,450 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:45:10,450 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:45:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:45:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:45:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 02:45:10,456 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-25 02:45:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:10,456 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 02:45:10,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:45:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 02:45:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:45:10,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:10,457 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:10,460 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-01-25 02:45:10,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:10,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:10,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:10,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:10,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:10,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:45:10,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:10,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:45:10,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:45:10,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:10,561 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-25 02:45:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:10,616 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 02:45:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:10,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:45:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:10,618 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:45:10,618 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:45:10,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:45:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:45:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:45:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:45:10,626 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-25 02:45:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:10,626 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:45:10,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:45:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:45:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:45:10,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:10,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:10,627 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-01-25 02:45:10,628 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:10,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:10,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:10,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:10,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:10,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:45:10,751 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:10,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:45:10,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:45:10,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:10,753 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-01-25 02:45:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:10,881 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-25 02:45:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:45:10,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 02:45:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:10,890 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:45:10,890 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 02:45:10,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:45:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 02:45:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-25 02:45:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:45:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-01-25 02:45:10,898 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-01-25 02:45:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:10,899 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-01-25 02:45:10,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:45:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-01-25 02:45:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:45:10,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:10,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:10,900 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-01-25 02:45:10,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:10,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:10,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:10,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:10,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:10,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:10,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:45:10,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:10,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:45:10,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:45:10,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:10,964 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-01-25 02:45:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:11,012 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-01-25 02:45:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:45:11,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:45:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:11,013 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:45:11,013 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 02:45:11,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 02:45:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 02:45:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:45:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-25 02:45:11,018 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-01-25 02:45:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:11,018 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-25 02:45:11,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:45:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-25 02:45:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:45:11,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:11,019 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:11,019 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-01-25 02:45:11,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:11,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:11,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,020 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:11,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:11,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:11,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:45:11,166 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:11,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:45:11,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:45:11,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:11,167 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-25 02:45:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:11,305 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-25 02:45:11,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:11,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 02:45:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:11,307 INFO L225 Difference]: With dead ends: 55 [2018-01-25 02:45:11,307 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:45:11,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:45:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:45:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:45:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-25 02:45:11,319 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-01-25 02:45:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:11,320 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-25 02:45:11,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:45:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-25 02:45:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:45:11,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:11,321 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:11,321 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-01-25 02:45:11,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:11,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:11,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:11,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:11,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:11,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:45:11,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:11,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:45:11,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:45:11,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:45:11,533 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-01-25 02:45:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:11,663 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-01-25 02:45:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:45:11,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 02:45:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:11,665 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:45:11,665 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 02:45:11,666 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:45:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 02:45:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-01-25 02:45:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:45:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 02:45:11,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-01-25 02:45:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:11,683 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 02:45:11,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:45:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 02:45:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:11,684 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:11,685 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:11,685 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-01-25 02:45:11,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:11,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:11,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:11,686 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:11,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:11,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:11,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:45:11,839 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:11,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:45:11,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:45:11,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:11,840 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-25 02:45:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:12,025 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 02:45:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:12,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 02:45:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:12,027 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:45:12,027 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:45:12,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:45:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 02:45:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:45:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 02:45:12,032 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-01-25 02:45:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:12,032 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 02:45:12,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:45:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 02:45:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:12,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:12,034 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:12,034 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-01-25 02:45:12,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:12,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:12,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:12,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:12,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:45:12,270 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:12,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:45:12,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:45:12,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:12,271 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-01-25 02:45:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:12,383 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-25 02:45:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:45:12,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-25 02:45:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:12,384 INFO L225 Difference]: With dead ends: 65 [2018-01-25 02:45:12,384 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 02:45:12,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:45:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 02:45:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-01-25 02:45:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:45:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 02:45:12,392 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-01-25 02:45:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:12,392 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 02:45:12,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:45:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 02:45:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:45:12,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:12,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:12,394 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-01-25 02:45:12,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:12,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:12,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:12,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:12,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:45:12,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:12,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:45:12,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:45:12,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:12,604 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-25 02:45:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:12,820 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 02:45:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:45:12,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 02:45:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:12,821 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:45:12,821 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:45:12,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:45:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 02:45:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:45:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-25 02:45:12,827 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-25 02:45:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:12,827 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-25 02:45:12,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:45:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-25 02:45:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:45:12,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:12,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:12,828 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-01-25 02:45:12,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:12,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:12,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:12,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:12,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:45:12,900 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:12,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:45:12,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:45:12,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:45:12,901 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-25 02:45:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:12,955 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-25 02:45:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:12,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 02:45:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:12,956 INFO L225 Difference]: With dead ends: 43 [2018-01-25 02:45:12,956 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 02:45:12,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:45:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 02:45:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 02:45:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 02:45:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-25 02:45:12,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-01-25 02:45:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:12,960 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-25 02:45:12,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:45:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-25 02:45:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:45:12,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:12,961 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:12,961 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-01-25 02:45:12,961 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:12,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:12,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:13,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:13,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:45:13,148 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:13,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:45:13,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:45:13,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:45:13,149 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2018-01-25 02:45:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:13,325 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-25 02:45:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:45:13,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 02:45:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:13,326 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:45:13,326 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:45:13,327 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:45:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:45:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-25 02:45:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:45:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-25 02:45:13,330 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-01-25 02:45:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:13,330 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-25 02:45:13,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:45:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-25 02:45:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:45:13,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:13,331 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:13,331 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-01-25 02:45:13,332 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:13,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:13,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:13,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:13,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:13,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:13,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:13,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:45:13,574 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:13,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:45:13,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:45:13,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:45:13,575 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-01-25 02:45:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:13,808 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-25 02:45:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:45:13,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-25 02:45:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:13,809 INFO L225 Difference]: With dead ends: 76 [2018-01-25 02:45:13,809 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:45:13,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:45:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:45:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:45:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:45:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-25 02:45:13,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-01-25 02:45:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:13,814 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-25 02:45:13,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:45:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-25 02:45:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:45:13,814 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:13,815 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:13,815 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-01-25 02:45:13,815 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:13,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:13,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:13,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:13,816 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:13,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:14,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:14,129 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:45:14,130 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 02:45:14,131 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [48], [49], [50], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 02:45:14,182 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:45:14,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:45:48,311 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:45:48,312 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 02:45:48,333 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:45:48,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:48,333 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:45:48,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:48,339 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:45:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:48,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:48,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:48,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:45:48,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:48,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:48,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:48,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 02:45:48,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:45:48,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 11 treesize of output 10 [2018-01-25 02:45:48,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:48,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 02:45:48,707 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-01-25 02:45:48,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:45:48,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:48,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:48,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 02:45:48,977 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-01-25 02:45:48,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:45:48,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:45:48,996 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-01-25 02:45:48,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:49,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:49,018 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-25 02:45:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:49,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:45:49,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:45:49,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:45:49,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 02:45:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:49,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:49,424 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:45:49,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:49,430 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:45:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:49,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:49,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:49,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:49,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 02:45:49,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:49,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:49,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:49,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 02:45:49,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 02:45:49,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:45:49,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:49,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:45:49,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 02:45:49,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:49,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:49,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:49,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 02:45:50,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-25 02:45:50,560 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 10 treesize of output 1 [2018-01-25 02:45:50,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:50,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:45:50,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 02:45:50,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:50,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:50,614 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-25 02:45:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:50,737 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:51,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:45:51,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:45:51,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:51,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:51,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 02:45:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:51,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:45:51,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 13, 11] total 47 [2018-01-25 02:45:51,225 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:45:51,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 02:45:51,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 02:45:51,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 02:45:51,227 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 23 states. [2018-01-25 02:45:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:52,670 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-25 02:45:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:45:52,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-25 02:45:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:52,672 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:45:52,672 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:45:52,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=302, Invalid=3004, Unknown=0, NotChecked=0, Total=3306 [2018-01-25 02:45:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:45:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-25 02:45:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:45:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 02:45:52,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-01-25 02:45:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:52,680 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 02:45:52,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 02:45:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 02:45:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:45:52,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:52,682 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:52,682 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:45:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-01-25 02:45:52,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:52,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:52,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:52,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:52,684 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:52,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:53,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:53,049 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:45:53,049 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-25 02:45:53,049 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [49], [50], [52], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 02:45:53,051 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:45:53,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:46:06,351 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:46:06,352 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:46:06,352 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:46:06,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:06,352 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:46:06,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:06,357 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:06,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:06,380 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:46:06,380 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:46:06,384 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:46:06,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:46:06 BoogieIcfgContainer [2018-01-25 02:46:06,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:46:06,386 INFO L168 Benchmark]: Toolchain (without parser) took 57752.37 ms. Allocated memory was 307.8 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 266.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 362.3 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:06,386 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 307.8 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:46:06,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.87 ms. Allocated memory is still 307.8 MB. Free memory was 266.5 MB in the beginning and 256.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:06,387 INFO L168 Benchmark]: Boogie Preprocessor took 33.33 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:06,387 INFO L168 Benchmark]: RCFGBuilder took 364.07 ms. Allocated memory is still 307.8 MB. Free memory was 254.5 MB in the beginning and 233.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:06,387 INFO L168 Benchmark]: TraceAbstraction took 57112.85 ms. Allocated memory was 307.8 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 233.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 329.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:06,388 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.26 ms. Allocated memory is still 307.8 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.87 ms. Allocated memory is still 307.8 MB. Free memory was 266.5 MB in the beginning and 256.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.33 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 364.07 ms. Allocated memory is still 307.8 MB. Free memory was 254.5 MB in the beginning and 233.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57112.85 ms. Allocated memory was 307.8 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 233.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 329.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 333 LocStat_NO_SUPPORTING_DISEQUALITIES : 66 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.345809 RENAME_VARIABLES(MILLISECONDS) : 0.341093 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.302559 PROJECTAWAY(MILLISECONDS) : 1.211704 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.075321 DISJOIN(MILLISECONDS) : 0.466254 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.363296 ADD_EQUALITY(MILLISECONDS) : 0.015118 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014929 #CONJOIN_DISJUNCTIVE : 66 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 117 #PROJECTAWAY : 87 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 57.0s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 571 SDtfs, 723 SDslu, 1544 SDs, 0 SdLazy, 1306 SolverSat, 92 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 47.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 419 ConstructedInterpolants, 29 QuantifiedInterpolants, 92169 SizeOfPredicates, 36 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 2/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-46-06-397.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-46-06-397.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-46-06-397.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-46-06-397.csv Completed graceful shutdown