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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:30:07,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:30:07,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:30:07,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:30:07,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:30:07,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:30:07,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:30:07,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:30:07,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:30:07,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:30:07,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:30:07,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:30:07,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:30:07,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:30:07,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:30:07,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:30:07,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:30:07,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:30:07,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:30:07,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:30:07,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:30:07,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:30:07,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:30:07,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:30:07,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:30:07,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:30:07,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:30:07,967 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:30:07,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:30:07,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:30:07,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:30:07,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:30:07,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:30:07,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:30:07,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:30:07,983 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:30:07,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:30:07,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:30:07,984 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:30:07,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:30:07,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:30:07,985 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:30:07,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:30:07,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:30:07,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:30:07,986 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:30:07,986 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:30:07,987 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:30:07,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:30:07,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:30:07,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:30:07,988 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:30:07,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:30:07,988 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:30:07,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:30:07,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:30:07,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:30:07,989 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:30:07,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:30:07,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:30:07,990 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:30:07,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:30:07,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:30:07,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:30:07,991 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:30:07,991 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:30:08,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:30:08,057 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:30:08,062 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:30:08,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:30:08,064 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:30:08,065 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-31 08:30:08,318 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:30:08,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:30:08,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:30:08,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:30:08,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:30:08,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689907bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08, skipping insertion in model container [2018-01-31 08:30:08,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:30:08,400 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:30:08,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:30:08,585 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:30:08,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08 WrapperNode [2018-01-31 08:30:08,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:30:08,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:30:08,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:30:08,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:30:08,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (1/1) ... [2018-01-31 08:30:08,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:30:08,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:30:08,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:30:08,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:30:08,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30: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-31 08:30:08,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:30:08,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:30:08,713 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-31 08:30:08,713 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:30:08,713 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:30:08,713 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:30:08,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:30:08,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:30:08,714 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:30:09,319 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:30:09,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:30:09 BoogieIcfgContainer [2018-01-31 08:30:09,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:30:09,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:30:09,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:30:09,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:30:09,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:30:08" (1/3) ... [2018-01-31 08:30:09,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7391a58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:30:09, skipping insertion in model container [2018-01-31 08:30:09,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:30:08" (2/3) ... [2018-01-31 08:30:09,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7391a58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:30:09, skipping insertion in model container [2018-01-31 08:30:09,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:30:09" (3/3) ... [2018-01-31 08:30:09,328 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:30:09,338 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:30:09,346 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:30:09,382 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:30:09,382 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:30:09,383 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:30:09,383 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:30:09,383 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:30:09,383 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:30:09,383 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:30:09,383 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:30:09,384 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:30:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-31 08:30:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:30:09,412 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:09,413 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:09,414 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1879822312, now seen corresponding path program 1 times [2018-01-31 08:30:09,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:09,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:09,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:09,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:09,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:09,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:10,040 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-31 08:30:10,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:10,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:30:10,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:30:10,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:30:10,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:30:10,154 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2018-01-31 08:30:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:10,299 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-31 08:30:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:30:10,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 08:30:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:10,314 INFO L225 Difference]: With dead ends: 108 [2018-01-31 08:30:10,314 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:30:10,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:30:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:30:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 08:30:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:30:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-31 08:30:10,354 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-01-31 08:30:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:10,355 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-31 08:30:10,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:30:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-31 08:30:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:30:10,356 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:10,356 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:10,356 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1855050500, now seen corresponding path program 1 times [2018-01-31 08:30:10,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:10,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:10,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:10,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:10,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:10,447 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-31 08:30:10,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:10,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:30:10,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:30:10,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:30:10,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:30:10,471 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-01-31 08:30:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:10,696 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-31 08:30:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:30:10,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:30:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:10,698 INFO L225 Difference]: With dead ends: 87 [2018-01-31 08:30:10,698 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:30:10,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:30:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:30:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 08:30:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:30:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-31 08:30:10,710 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-01-31 08:30:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:10,711 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-31 08:30:10,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:30:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-31 08:30:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:30:10,712 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:10,712 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:10,712 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1855050499, now seen corresponding path program 1 times [2018-01-31 08:30:10,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:10,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:10,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:10,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:10,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:10,876 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-31 08:30:10,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:10,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:30:10,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:30:10,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:30:10,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:30:10,877 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-01-31 08:30:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:10,951 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-31 08:30:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:30:10,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:30:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:10,954 INFO L225 Difference]: With dead ends: 86 [2018-01-31 08:30:10,954 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:30:10,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:30:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:30:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 08:30:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:30:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-31 08:30:10,964 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-01-31 08:30:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:10,965 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-31 08:30:10,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:30:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-31 08:30:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:30:10,966 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:10,966 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:10,966 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880838, now seen corresponding path program 1 times [2018-01-31 08:30:10,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:10,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:10,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:10,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:10,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:11,065 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-31 08:30:11,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:11,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:30:11,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:30:11,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:30:11,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:30:11,066 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-31 08:30:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:11,456 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-01-31 08:30:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:30:11,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-31 08:30:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:11,460 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:30:11,460 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:30:11,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:30:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:30:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-31 08:30:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:30:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-31 08:30:11,469 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 28 [2018-01-31 08:30:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:11,470 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-31 08:30:11,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:30:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-31 08:30:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:30:11,471 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:11,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:11,471 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880837, now seen corresponding path program 1 times [2018-01-31 08:30:11,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:11,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:11,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:11,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:11,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:11,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:11,601 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-31 08:30:11,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:11,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:30:11,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:30:11,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:30:11,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:30:11,603 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-01-31 08:30:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:11,784 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-31 08:30:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:30:11,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-31 08:30:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:11,785 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:30:11,786 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:30:11,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:30:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:30:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-01-31 08:30:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 08:30:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-31 08:30:11,795 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 28 [2018-01-31 08:30:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:11,795 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-31 08:30:11,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:30:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-31 08:30:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:30:11,796 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:11,796 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:11,797 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1510334872, now seen corresponding path program 1 times [2018-01-31 08:30:11,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:11,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:11,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:11,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:11,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:11,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:11,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-31 08:30:11,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:11,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:30:11,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:30:11,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:30:11,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:30:11,902 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 6 states. [2018-01-31 08:30:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:12,313 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-31 08:30:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:30:12,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 08:30:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:12,315 INFO L225 Difference]: With dead ends: 94 [2018-01-31 08:30:12,315 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 08:30:12,315 INFO L554 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-31 08:30:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 08:30:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-31 08:30:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 08:30:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-01-31 08:30:12,325 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 31 [2018-01-31 08:30:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:12,326 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-01-31 08:30:12,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:30:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-01-31 08:30:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:30:12,327 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:12,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:12,327 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1510334871, now seen corresponding path program 1 times [2018-01-31 08:30:12,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:12,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:12,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:12,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:12,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:12,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:12,581 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-31 08:30:12,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:12,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:30:12,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:30:12,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:30:12,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:30:12,582 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-01-31 08:30:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:12,798 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-01-31 08:30:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:30:12,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-31 08:30:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:12,800 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:30:12,800 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:30:12,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:30:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:30:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-31 08:30:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 08:30:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-31 08:30:12,809 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 31 [2018-01-31 08:30:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:12,810 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-31 08:30:12,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:30:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-31 08:30:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:30:12,811 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:12,811 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:12,811 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1711960891, now seen corresponding path program 1 times [2018-01-31 08:30:12,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:12,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:12,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:12,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:12,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:12,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:13,047 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-31 08:30:13,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:13,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:30:13,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:30:13,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:30:13,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:30:13,049 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 6 states. [2018-01-31 08:30:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:13,347 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-31 08:30:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:30:13,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-31 08:30:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:13,348 INFO L225 Difference]: With dead ends: 93 [2018-01-31 08:30:13,348 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 08:30:13,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:30:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 08:30:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 08:30:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:30:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-31 08:30:13,355 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 38 [2018-01-31 08:30:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:13,355 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-31 08:30:13,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:30:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-31 08:30:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:30:13,357 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:13,357 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:13,357 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 443587635, now seen corresponding path program 1 times [2018-01-31 08:30:13,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:13,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:13,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:13,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:13,522 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-31 08:30:13,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:13,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:30:13,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:30:13,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:30:13,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:30:13,523 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 4 states. [2018-01-31 08:30:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:13,567 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-31 08:30:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:30:13,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-31 08:30:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:13,568 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:30:13,568 INFO L226 Difference]: Without dead ends: 70 [2018-01-31 08:30:13,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:30:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-31 08:30:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-31 08:30:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 08:30:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-31 08:30:13,576 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 38 [2018-01-31 08:30:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:13,577 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-31 08:30:13,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:30:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-31 08:30:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:30:13,578 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:13,578 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:13,578 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 443587636, now seen corresponding path program 1 times [2018-01-31 08:30:13,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:13,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:13,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:13,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:13,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:13,772 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-31 08:30:13,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:13,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:30:13,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:30:13,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:30:13,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:30:13,773 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2018-01-31 08:30:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:13,866 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-01-31 08:30:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:30:13,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-31 08:30:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:13,867 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:30:13,867 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:30:13,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:30:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:30:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-01-31 08:30:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:30:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-31 08:30:13,873 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 38 [2018-01-31 08:30:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:13,873 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-31 08:30:13,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:30:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-31 08:30:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:30:13,874 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:13,874 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:13,875 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1257630254, now seen corresponding path program 1 times [2018-01-31 08:30:13,875 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:13,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:13,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:13,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:13,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:13,993 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-31 08:30:13,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:13,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:30:13,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:30:13,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:30:13,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:30:13,994 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 7 states. [2018-01-31 08:30:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:14,119 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-31 08:30:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:30:14,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-31 08:30:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:14,120 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:30:14,120 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:30:14,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:30:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:30:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 08:30:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:30:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-31 08:30:14,126 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2018-01-31 08:30:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:14,126 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-31 08:30:14,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:30:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-31 08:30:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:30:14,127 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:14,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:14,127 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1257630255, now seen corresponding path program 1 times [2018-01-31 08:30:14,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:14,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:14,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:14,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:14,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:14,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:14,770 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-31 08:30:14,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:30:14,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:30:14,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:30:14,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:30:14,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:30:14,771 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 12 states. [2018-01-31 08:30:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:15,064 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-01-31 08:30:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:30:15,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-01-31 08:30:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:15,065 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:30:15,065 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:30:15,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:30:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:30:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2018-01-31 08:30:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:30:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-01-31 08:30:15,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 39 [2018-01-31 08:30:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:15,070 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-01-31 08:30:15,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:30:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-01-31 08:30:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:30:15,071 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:15,072 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:30:15,072 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -9982663, now seen corresponding path program 1 times [2018-01-31 08:30:15,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:15,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:15,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:15,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:15,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:15,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:15,906 WARN L146 SmtUtils]: Spent 426ms on a formula simplification. DAG size of input: 21 DAG size of output 15 [2018-01-31 08:30:16,169 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-31 08:30:16,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:16,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:16,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:16,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:16,323 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-31 08:30:16,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:30:16,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:30:16,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:30:16,481 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-31 08:30:16,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:30:16,528 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-31 08:30:16,532 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-31 08:30:16,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,540 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-31 08:30:16,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:30:16,603 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-31 08:30:16,605 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-31 08:30:16,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:16,654 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-31 08:30:16,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:30:17,191 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-31 08:30:17,199 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-31 08:30:17,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:17,213 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-31 08:30:17,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:17,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:30:17,266 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-31 08:30:17,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-31 08:30:17,576 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-31 08:30:17,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:30:17,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-01-31 08:30:17,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:30:17,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:30:17,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:30:17,599 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 25 states. [2018-01-31 08:30:18,965 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 77 DAG size of output 55 [2018-01-31 08:30:19,169 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 71 DAG size of output 52 [2018-01-31 08:30:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:19,428 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-01-31 08:30:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:30:19,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-01-31 08:30:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:19,430 INFO L225 Difference]: With dead ends: 100 [2018-01-31 08:30:19,430 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:30:19,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:30:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:30:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-01-31 08:30:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:30:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-31 08:30:19,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 47 [2018-01-31 08:30:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:19,439 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-31 08:30:19,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:30:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-31 08:30:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:30:19,440 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:19,440 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:19,440 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1040766997, now seen corresponding path program 1 times [2018-01-31 08:30:19,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:19,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:19,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:19,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:19,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:19,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:19,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:19,921 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:19,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:19,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:20,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:30:20,021 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-31 08:30:20,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:20,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:20,104 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-31 08:30:20,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:30:20,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-31 08:30:20,474 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 27 treesize of output 20 [2018-01-31 08:30:20,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:20,489 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 20 treesize of output 18 [2018-01-31 08:30:20,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:20,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-31 08:30:20,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:20,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:30:20,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:30:20,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-31 08:30:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:20,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:30:20,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2018-01-31 08:30:20,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:30:20,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:30:20,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:30:20,616 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 27 states. [2018-01-31 08:30:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:22,851 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-01-31 08:30:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:30:22,852 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-01-31 08:30:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:22,852 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:30:22,852 INFO L226 Difference]: Without dead ends: 90 [2018-01-31 08:30:22,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=1662, Unknown=0, NotChecked=0, Total=1892 [2018-01-31 08:30:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-31 08:30:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-01-31 08:30:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:30:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-01-31 08:30:22,862 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 50 [2018-01-31 08:30:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:22,862 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-01-31 08:30:22,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:30:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-01-31 08:30:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:30:22,863 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:22,863 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:22,863 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1564459918, now seen corresponding path program 1 times [2018-01-31 08:30:22,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:22,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:22,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:22,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:22,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:22,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:23,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:23,286 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:23,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:23,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:23,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:30:23,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-31 08:30:23,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:30:23,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:30:23,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:30:23,363 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 12 states. [2018-01-31 08:30:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:23,520 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-01-31 08:30:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:30:23,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-01-31 08:30:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:23,521 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:30:23,521 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:30:23,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:30:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:30:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-01-31 08:30:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:30:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-01-31 08:30:23,529 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 57 [2018-01-31 08:30:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:23,529 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-01-31 08:30:23,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:30:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-01-31 08:30:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:30:23,533 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:23,533 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:30:23,533 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -862301775, now seen corresponding path program 1 times [2018-01-31 08:30:23,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:23,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:23,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:23,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:23,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:23,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:23,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:23,800 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:23,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:23,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:24,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:30:24,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 15 [2018-01-31 08:30:24,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:30:24,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:30:24,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:30:24,055 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 16 states. [2018-01-31 08:30:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:24,327 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-01-31 08:30:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:30:24,327 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-01-31 08:30:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:24,327 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:30:24,328 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 08:30:24,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:30:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 08:30:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-31 08:30:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:30:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-01-31 08:30:24,334 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2018-01-31 08:30:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:24,335 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-01-31 08:30:24,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:30:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-01-31 08:30:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:30:24,335 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:24,335 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:24,336 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1886745275, now seen corresponding path program 2 times [2018-01-31 08:30:24,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:24,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:24,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:24,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:30:24,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:24,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:24,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:24,912 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:24,917 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:30:24,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:30:24,940 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:30:24,944 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:30:24,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:24,959 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-31 08:30:24,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:24,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:30:24,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:24,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:24,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:30:25,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:30:25,021 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-31 08:30:25,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:30:25,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:30:25,030 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-31 08:30:25,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:30:25,083 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-31 08:30:25,085 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-31 08:30:25,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,092 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-31 08:30:25,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-31 08:30:25,126 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-31 08:30:25,128 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-31 08:30:25,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:30:25,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-31 08:30:25,696 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 34 treesize of output 32 [2018-01-31 08:30:25,704 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-31 08:30:25,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:25,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-31 08:30:25,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:25,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:30:25,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:30:25,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-31 08:30:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:25,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:30:25,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-01-31 08:30:25,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:30:25,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:30:25,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:30:25,865 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 33 states. [2018-01-31 08:30:28,502 WARN L146 SmtUtils]: Spent 2075ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-31 08:30:31,134 WARN L146 SmtUtils]: Spent 773ms on a formula simplification. DAG size of input: 62 DAG size of output 52 [2018-01-31 08:30:35,272 WARN L146 SmtUtils]: Spent 4032ms on a formula simplification. DAG size of input: 50 DAG size of output 47 [2018-01-31 08:30:39,012 WARN L146 SmtUtils]: Spent 3624ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-01-31 08:30:41,366 WARN L146 SmtUtils]: Spent 2233ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-01-31 08:30:42,221 WARN L143 SmtUtils]: Spent 810ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-31 08:30:46,314 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-01-31 08:30:48,751 WARN L146 SmtUtils]: Spent 2316ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-31 08:30:51,581 WARN L146 SmtUtils]: Spent 2529ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-01-31 08:30:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:51,611 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-01-31 08:30:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:30:51,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-01-31 08:30:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:51,612 INFO L225 Difference]: With dead ends: 79 [2018-01-31 08:30:51,612 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:30:51,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2018-01-31 08:30:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:30:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2018-01-31 08:30:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:30:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-01-31 08:30:51,620 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2018-01-31 08:30:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:51,621 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-01-31 08:30:51,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:30:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-01-31 08:30:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:30:51,621 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:30:51,621 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:30:51,622 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:30:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash -208512215, now seen corresponding path program 2 times [2018-01-31 08:30:51,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:30:51,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:30:51,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:51,623 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:30:51,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:30:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:30:51,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:30:52,192 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 17 DAG size of output 9 [2018-01-31 08:30:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:52,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:30:52,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:30:52,672 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:30:52,685 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:30:52,694 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:30:52,697 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:30:52,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:30:52,727 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-31 08:30:52,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:52,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:52,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:30:52,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:30:52,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:30:52,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:52,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:52,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:30:52,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-31 08:30:53,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-01-31 08:30:53,081 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 28 treesize of output 21 [2018-01-31 08:30:53,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:30:53,098 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 21 treesize of output 19 [2018-01-31 08:30:53,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:53,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-01-31 08:30:53,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:30:53,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:30:53,146 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-31 08:30:53,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-31 08:30:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:30:53,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:30:53,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-01-31 08:30:53,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 08:30:53,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 08:30:53,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:30:53,229 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 32 states. [2018-01-31 08:30:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:30:55,185 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-31 08:30:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:30:55,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-01-31 08:30:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:30:55,186 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:30:55,186 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:30:55,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=411, Invalid=2781, Unknown=0, NotChecked=0, Total=3192 [2018-01-31 08:30:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:30:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:30:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:30:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:30:55,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-01-31 08:30:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:30:55,188 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:30:55,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 08:30:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:30:55,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:30:55,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:30:55,510 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 90 DAG size of output 62 [2018-01-31 08:31:13,769 WARN L146 SmtUtils]: Spent 18255ms on a formula simplification. DAG size of input: 169 DAG size of output 125 [2018-01-31 08:31:14,615 WARN L146 SmtUtils]: Spent 843ms on a formula simplification. DAG size of input: 102 DAG size of output 1 [2018-01-31 08:31:14,618 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,653 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-31 08:31:14,654 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L395 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString2~4.base)) (.cse1 (select |#length| main_~nondetString1~4.base))) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ .cse0 (- 1))) 0) (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~nondetString2~4.base main_~nondetString1~4.base)) (= 0 |main_#t~malloc11.offset|) (not (= |main_#t~malloc12.base| main_~nondetString1~4.base)) (<= 1 main_~length2~4) (= (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0) |old(#valid)|) (= main_~nondetString2~4.offset 0) (= main_~length1~4 (select |#length| |main_#t~malloc11.base|)) (= main_~length2~4 .cse0) (<= (+ main_~nondetString1~4.offset 1) .cse1) (= main_~nondetString1~4.offset 0) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc12.offset|) (= 1 (select |#valid| main_~nondetString2~4.base)) (= main_~length2~4 (select |#length| |main_#t~malloc12.base|)) (= .cse1 main_~length1~4) (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (exists ((main_~nondetString1~4.offset Int)) (and (<= main_~nondetString1~4.offset 0) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset (select |#length| main_~nondetString1~4.base) (- 1))) 0) (<= 0 main_~nondetString1~4.offset))) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-31 08:31:14,655 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L566''''(line 566) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L566'''(line 566) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-31 08:31:14,656 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-31 08:31:14,657 INFO L399 ceAbstractionStarter]: For program point L566''(line 566) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-31 08:31:14,658 INFO L399 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-31 08:31:14,659 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L546'''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L547''''''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L546''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,660 INFO L399 ceAbstractionStarter]: For program point L546''''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point L545''''(lines 545 550) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,661 INFO L399 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:31:14,662 INFO L395 ceAbstractionStarter]: At program point L545'''(lines 545 550) the Hoare annotation is: (let ((.cse4 (select |#length| cstrncmp_~s1.base)) (.cse8 (select |#length| cstrncmp_~s2.base))) (let ((.cse6 (select |#length| |cstrncmp_#in~s2.base|)) (.cse1 (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ (select |#length| main_~nondetString2~4.base) main_~nondetString2~4.offset (- 1))) 0) (not (= main_~nondetString2~4.base cstrncmp_~s1.base))))) (.cse0 (exists ((main_~nondetString1~4.offset Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ main_~nondetString1~4.offset (select |#length| cstrncmp_~s1.base) (- 1)))) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (.cse7 (<= (+ cstrncmp_~s2.offset 1) .cse8)) (.cse2 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse3 (= (select (select |#memory_int| cstrncmp_~s2.base) (+ .cse8 (- 1))) 0)) (.cse5 (= 1 (select |#valid| cstrncmp_~s2.base))) (.cse9 (<= (+ cstrncmp_~s1.offset 1) .cse4))) (or (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|))) (and .cse0 .cse1 .cse2 (= 0 cstrncmp_~s2.offset) .cse3 (<= 1 .cse4) (exists ((main_~length2~4 Int) (v_main_~nondetString2~4.offset_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| cstrncmp_~s2.base) (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1) (select |#length| cstrncmp_~s2.base)) (<= cstrncmp_~s2.offset v_main_~nondetString2~4.offset_BEFORE_CALL_1) (<= 1 main_~length2~4))) (= 0 cstrncmp_~s1.offset) .cse5) (< .cse6 1) (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1)))) (not (= main_~nondetString2~4.base |cstrncmp_#in~s1.base|))))) (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ .cse6 (- 1))))) (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1)) (not (= 0 |cstrncmp_#in~s1.offset|)) (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrncmp_#in~s1.base|)) (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1)))) (not (exists ((main_~nondetString1~4.offset Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~nondetString1~4.offset (select |#length| |cstrncmp_#in~s1.base|) (- 1))) 0) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (and (<= 1 cstrncmp_~s1.offset) .cse0 .cse1 .cse7 .cse2 (<= 1 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s1.offset 2) .cse4) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse8) (<= cstrncmp_~s2.offset 1)) .cse3 .cse5 .cse9) (not (= 0 |cstrncmp_#in~s2.offset|)) (and (<= 2 cstrncmp_~s2.offset) .cse0 (<= 2 cstrncmp_~s1.offset) .cse7 .cse2 .cse3 .cse5 .cse9)))) [2018-01-31 08:31:14,662 INFO L399 ceAbstractionStarter]: For program point L547'''''''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,662 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:31:14,662 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-31 08:31:14,662 INFO L402 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 552) the Hoare annotation is: true [2018-01-31 08:31:14,662 INFO L399 ceAbstractionStarter]: For program point L546'''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,662 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-31 08:31:14,663 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,663 INFO L399 ceAbstractionStarter]: For program point L545'(lines 545 550) no Hoare annotation was computed. [2018-01-31 08:31:14,663 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-31 08:31:14,663 INFO L399 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:31:14,663 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-31 08:31:14,664 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-31 08:31:14,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,685 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,719 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,719 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:31:14 BoogieIcfgContainer [2018-01-31 08:31:14,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:31:14,738 INFO L168 Benchmark]: Toolchain (without parser) took 66419.05 ms. Allocated memory was 304.1 MB in the beginning and 622.9 MB in the end (delta: 318.8 MB). Free memory was 263.8 MB in the beginning and 442.9 MB in the end (delta: -179.1 MB). Peak memory consumption was 139.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:31:14,739 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:31:14,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.34 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:31:14,740 INFO L168 Benchmark]: Boogie Preprocessor took 47.03 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:31:14,742 INFO L168 Benchmark]: RCFGBuilder took 679.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 227.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:31:14,742 INFO L168 Benchmark]: TraceAbstraction took 65415.85 ms. Allocated memory was 304.1 MB in the beginning and 622.9 MB in the end (delta: 318.8 MB). Free memory was 227.8 MB in the beginning and 442.9 MB in the end (delta: -215.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:31:14,744 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.15 ms. Allocated memory is still 304.1 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.34 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.03 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 679.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 227.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65415.85 ms. Allocated memory was 304.1 MB in the beginning and 622.9 MB in the end (delta: 318.8 MB). Free memory was 227.8 MB in the beginning and 442.9 MB in the end (delta: -215.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-31 08:31:14,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,768 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,768 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,788 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,788 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,788 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,788 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:31:14,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:31:14,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:31:14,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-31 08:31:14,805 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,805 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,806 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,806 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,806 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,806 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:31:14,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:31:14,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(1 == \valid[s2]) || (((((((((\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && 1 == \valid[s1]) && 0 == s2) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 <= unknown-#length-unknown[s1]) && (\exists main_~length2~4 : int, v_main_~nondetString2~4.offset_BEFORE_CALL_1 : int :: ((unknown-#memory_int-unknown[s2][main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 + -1] == 0 && main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s2]) && s2 <= v_main_~nondetString2~4.offset_BEFORE_CALL_1) && 1 <= main_~length2~4)) && 0 == s1) && 1 == \valid[s2])) || unknown-#length-unknown[s2] < 1) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1] && !(main_~nondetString2~4.base == s1))) || !(0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1])) || !(\valid[s1] == 1)) || !(0 == s1)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1] && unknown-#memory_int-unknown[s1][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4) && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1)) || !(\exists main_~nondetString1~4.offset : int :: (unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] == 0 && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) || ((((((((((1 <= s1 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 <= s2) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || s2 <= 1)) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[s2]) && s1 + 1 <= unknown-#length-unknown[s1])) || !(0 == s2)) || (((((((2 <= s2 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[s2]) && s1 + 1 <= unknown-#length-unknown[s1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 15 error locations. SAFE Result, 65.2s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 34.8s AutomataDifference, 0.0s DeadEndRemovalTime, 19.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1139 SDtfs, 1897 SDslu, 6267 SDs, 0 SdLazy, 3288 SolverSat, 157 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 310 SyntacticMatches, 6 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 9 NumberOfFragments, 489 HoareAnnotationTreeSize, 7 FomulaSimplifications, 110 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 897 FormulaSimplificationTreeSizeReductionInter, 19.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1039 ConstructedInterpolants, 75 QuantifiedInterpolants, 551503 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1079 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 42/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-31-14-820.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-31-14-820.csv Received shutdown request...