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_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:08:00,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:08:00,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:08:00,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:08:00,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:08:00,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:08:00,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:08:00,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:08:00,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:08:00,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:08:00,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:08:00,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:08:00,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:08:00,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:08:00,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:08:01,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:08:01,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:08:01,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:08:01,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:08:01,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:08:01,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:08:01,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:08:01,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:08:01,011 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:08:01,012 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:08:01,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:08:01,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:08:01,014 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:08:01,014 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:08:01,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:08:01,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:08:01,015 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-28 21:08:01,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:08:01,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:08:01,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:08:01,026 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:08:01,027 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:08:01,027 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:08:01,027 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:08:01,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:08:01,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:08:01,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:08:01,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:08:01,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:08:01,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:08:01,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:08:01,030 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:08:01,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:08:01,030 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:08:01,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:08:01,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:08:01,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:08:01,031 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:08:01,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:08:01,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:08:01,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:08:01,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:08:01,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:08:01,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:08:01,033 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:08:01,033 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:08:01,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:08:01,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:08:01,085 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:08:01,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:08:01,088 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:08:01,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:08:01,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:08:01,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:08:01,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:08:01,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:08:01,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:08:01,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01, skipping insertion in model container [2018-01-28 21:08:01,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,335 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:08:01,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:08:01,489 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:08:01,503 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:08:01,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01 WrapperNode [2018-01-28 21:08:01,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:08:01,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:08:01,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:08:01,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:08:01,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (1/1) ... [2018-01-28 21:08:01,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:08:01,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:08:01,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:08:01,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:08:01,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (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-28 21:08:01,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:08:01,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:08:01,585 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-28 21:08:01,585 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:08:01,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:08:01,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-28 21:08:01,586 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:08:01,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:08:01,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:08:01,768 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:08:01,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:08:01 BoogieIcfgContainer [2018-01-28 21:08:01,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:08:01,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:08:01,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:08:01,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:08:01,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:08:01" (1/3) ... [2018-01-28 21:08:01,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7911a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:08:01, skipping insertion in model container [2018-01-28 21:08:01,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:08:01" (2/3) ... [2018-01-28 21:08:01,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7911a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:08:01, skipping insertion in model container [2018-01-28 21:08:01,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:08:01" (3/3) ... [2018-01-28 21:08:01,775 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:08:01,781 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:08:01,787 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-28 21:08:01,834 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:08:01,834 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:08:01,834 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:08:01,834 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:08:01,834 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:08:01,835 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:08:01,835 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:08:01,835 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:08:01,836 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:08:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-28 21:08:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 21:08:01,861 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:01,862 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:01,863 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 285740110, now seen corresponding path program 1 times [2018-01-28 21:08:01,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:01,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:01,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:01,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:01,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:01,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:02,051 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-28 21:08:02,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:02,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:08:02,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:08:02,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:08:02,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:08:02,067 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-01-28 21:08:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:02,176 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-28 21:08:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:08:02,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-28 21:08:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:02,249 INFO L225 Difference]: With dead ends: 73 [2018-01-28 21:08:02,250 INFO L226 Difference]: Without dead ends: 54 [2018-01-28 21:08:02,254 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:08:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-28 21:08:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-28 21:08:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 21:08:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-28 21:08:02,296 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 17 [2018-01-28 21:08:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:02,297 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-28 21:08:02,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:08:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-28 21:08:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:08:02,298 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:02,298 INFO L330 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-28 21:08:02,298 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash -82842589, now seen corresponding path program 1 times [2018-01-28 21:08:02,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:02,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:02,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:02,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:02,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:02,386 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-28 21:08:02,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:02,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:08:02,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:08:02,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:08:02,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:08:02,389 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 4 states. [2018-01-28 21:08:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:02,465 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-28 21:08:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:08:02,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:08:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:02,467 INFO L225 Difference]: With dead ends: 54 [2018-01-28 21:08:02,467 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 21:08:02,468 INFO L533 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-28 21:08:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 21:08:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-28 21:08:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 21:08:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-28 21:08:02,473 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 20 [2018-01-28 21:08:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:02,473 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-28 21:08:02,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:08:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-28 21:08:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:08:02,474 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:02,474 INFO L330 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-28 21:08:02,474 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -82842588, now seen corresponding path program 1 times [2018-01-28 21:08:02,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:02,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:02,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:02,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:02,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:02,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:02,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:08:02,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:08:02,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:08:02,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:08:02,606 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2018-01-28 21:08:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:02,696 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-01-28 21:08:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:08:02,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:08:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:02,698 INFO L225 Difference]: With dead ends: 53 [2018-01-28 21:08:02,698 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 21:08:02,698 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:08:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 21:08:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 21:08:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 21:08:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-28 21:08:02,704 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 20 [2018-01-28 21:08:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:02,704 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-28 21:08:02,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:08:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-28 21:08:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 21:08:02,705 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:02,705 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:02,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1935542125, now seen corresponding path program 1 times [2018-01-28 21:08:02,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:02,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:02,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:02,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:02,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:02,759 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-28 21:08:02,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:02,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:08:02,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:08:02,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:08:02,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:08:02,760 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2018-01-28 21:08:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:02,829 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-28 21:08:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:08:02,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-28 21:08:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:02,830 INFO L225 Difference]: With dead ends: 52 [2018-01-28 21:08:02,830 INFO L226 Difference]: Without dead ends: 51 [2018-01-28 21:08:02,831 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:08:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-28 21:08:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-28 21:08:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 21:08:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-28 21:08:02,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 25 [2018-01-28 21:08:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:02,838 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-28 21:08:02,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:08:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-28 21:08:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 21:08:02,839 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:02,839 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:02,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1935542124, now seen corresponding path program 1 times [2018-01-28 21:08:02,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:02,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:02,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:02,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:02,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:02,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:02,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:08:02,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:08:02,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:08:02,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:08:02,952 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 8 states. [2018-01-28 21:08:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:03,075 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-28 21:08:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:08:03,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-28 21:08:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:03,078 INFO L225 Difference]: With dead ends: 65 [2018-01-28 21:08:03,079 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 21:08:03,079 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:08:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 21:08:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-01-28 21:08:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 21:08:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-28 21:08:03,088 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 25 [2018-01-28 21:08:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:03,088 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-28 21:08:03,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:08:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-28 21:08:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 21:08:03,090 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:03,090 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:03,090 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash 127736295, now seen corresponding path program 1 times [2018-01-28 21:08:03,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:03,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:03,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:03,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:03,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:03,228 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-28 21:08:03,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:03,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:08:03,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:08:03,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:08:03,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:08:03,230 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 10 states. [2018-01-28 21:08:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:03,443 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-01-28 21:08:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:08:03,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-28 21:08:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:03,445 INFO L225 Difference]: With dead ends: 53 [2018-01-28 21:08:03,445 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 21:08:03,446 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:08:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 21:08:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 21:08:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 21:08:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-28 21:08:03,452 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 26 [2018-01-28 21:08:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:03,453 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-28 21:08:03,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:08:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-28 21:08:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 21:08:03,454 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:03,454 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:03,454 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 127736296, now seen corresponding path program 1 times [2018-01-28 21:08:03,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:03,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:03,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:03,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:03,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:03,565 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-28 21:08:03,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:03,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:08:03,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:08:03,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:08:03,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:08:03,566 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 8 states. [2018-01-28 21:08:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:03,724 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-28 21:08:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:08:03,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-28 21:08:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:03,726 INFO L225 Difference]: With dead ends: 65 [2018-01-28 21:08:03,726 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 21:08:03,726 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:08:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 21:08:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-01-28 21:08:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 21:08:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-28 21:08:03,734 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 26 [2018-01-28 21:08:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:03,734 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-28 21:08:03,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:08:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-28 21:08:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:08:03,735 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:03,736 INFO L330 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] [2018-01-28 21:08:03,736 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:03,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1893175373, now seen corresponding path program 1 times [2018-01-28 21:08:03,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:03,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:03,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:03,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:03,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:04,040 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-28 21:08:04,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:08:04,040 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-28 21:08:04,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:04,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:08:04,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-28 21:08:04,146 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-28 21:08:04,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:04,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:04,160 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-28 21:08:04,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:08:04,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-28 21:08:04,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 21:08:04,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:08:04,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:08:04,296 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-28 21:08:04,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-28 21:08:04,370 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-28 21:08:04,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:08:04,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-01-28 21:08:04,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 21:08:04,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 21:08:04,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:08:04,402 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states. [2018-01-28 21:08:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:04,845 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-28 21:08:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:08:04,846 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-01-28 21:08:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:04,847 INFO L225 Difference]: With dead ends: 78 [2018-01-28 21:08:04,847 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 21:08:04,848 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:08:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 21:08:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-01-28 21:08:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-28 21:08:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-01-28 21:08:04,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 36 [2018-01-28 21:08:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:04,857 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-01-28 21:08:04,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 21:08:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-01-28 21:08:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:08:04,858 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:04,858 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:04,859 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1441105585, now seen corresponding path program 1 times [2018-01-28 21:08:04,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:04,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:04,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:04,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:04,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:04,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:05,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:08:05,129 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-28 21:08:05,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:05,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:08:05,172 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-28 21:08:05,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,179 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-28 21:08:05,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-28 21:08:05,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:05,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:05,228 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-28 21:08:05,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,237 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-28 21:08:05,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:05,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-28 21:08:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:05,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:08:05,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-28 21:08:05,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 21:08:05,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 21:08:05,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-28 21:08:05,548 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 26 states. [2018-01-28 21:08:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:06,265 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-28 21:08:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:08:06,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-01-28 21:08:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:06,267 INFO L225 Difference]: With dead ends: 80 [2018-01-28 21:08:06,267 INFO L226 Difference]: Without dead ends: 79 [2018-01-28 21:08:06,268 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 21:08:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-28 21:08:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-01-28 21:08:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-28 21:08:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-28 21:08:06,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-28 21:08:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:06,277 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-28 21:08:06,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 21:08:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-28 21:08:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:08:06,278 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:06,279 INFO L330 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-28 21:08:06,279 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1606546944, now seen corresponding path program 1 times [2018-01-28 21:08:06,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:06,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:06,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:06,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:06,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:06,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:06,457 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-28 21:08:06,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:08:06,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:08:06,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:08:06,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:08:06,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:08:06,459 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-01-28 21:08:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:06,543 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-28 21:08:06,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:08:06,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-28 21:08:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:06,545 INFO L225 Difference]: With dead ends: 64 [2018-01-28 21:08:06,545 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 21:08:06,545 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:08:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 21:08:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 21:08:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 21:08:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-28 21:08:06,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 38 [2018-01-28 21:08:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:06,553 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-28 21:08:06,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:08:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-28 21:08:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:08:06,555 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:06,555 INFO L330 BasicCegarLoop]: trace histogram [3, 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] [2018-01-28 21:08:06,555 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1586619660, now seen corresponding path program 2 times [2018-01-28 21:08:06,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:06,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:06,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:06,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:08:06,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:06,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:07,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:08:07,046 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-28 21:08:07,051 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:08:07,065 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:08:07,073 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:08:07,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:08:07,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:08:07,102 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-28 21:08:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:08:07,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:07,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:07,147 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-28 21:08:07,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-28 21:08:07,188 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-28 21:08:07,190 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-28 21:08:07,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,197 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-28 21:08:07,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-28 21:08:07,379 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-28 21:08:07,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:08:07,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:08:07,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-01-28 21:08:07,731 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 41 treesize of output 35 [2018-01-28 21:08:07,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-28 21:08:07,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:07,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:07,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-28 21:08:07,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:08:07,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:08:07,809 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-28 21:08:07,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:43 [2018-01-28 21:08:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:07,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:08:07,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-01-28 21:08:07,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 21:08:07,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 21:08:07,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-01-28 21:08:07,891 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 31 states. [2018-01-28 21:08:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:10,860 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-01-28 21:08:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:08:10,860 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2018-01-28 21:08:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:10,861 INFO L225 Difference]: With dead ends: 69 [2018-01-28 21:08:10,861 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 21:08:10,863 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:08:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 21:08:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-01-28 21:08:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-28 21:08:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-28 21:08:10,869 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 47 [2018-01-28 21:08:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:10,869 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-28 21:08:10,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 21:08:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-28 21:08:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:08:10,871 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:10,871 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-28 21:08:10,871 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1940569208, now seen corresponding path program 2 times [2018-01-28 21:08:10,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:10,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:10,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:10,872 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:08:10,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:10,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:11,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:08:11,133 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-28 21:08:11,138 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:08:11,148 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:08:11,154 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:08:11,156 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:08:11,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:08:11,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:08:11,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:08:11,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-28 21:08:11,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:11,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:11,191 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-28 21:08:11,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,201 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-28 21:08:11,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:11,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-28 21:08:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:08:11,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:08:11,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-28 21:08:11,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 21:08:11,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 21:08:11,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-28 21:08:11,536 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 26 states. [2018-01-28 21:08:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:12,285 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-28 21:08:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:08:12,285 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-01-28 21:08:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:12,286 INFO L225 Difference]: With dead ends: 70 [2018-01-28 21:08:12,286 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 21:08:12,286 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 21:08:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 21:08:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-28 21:08:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 21:08:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-28 21:08:12,294 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48 [2018-01-28 21:08:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:12,294 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-28 21:08:12,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 21:08:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-28 21:08:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 21:08:12,295 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:08:12,296 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:08:12,296 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 21:08:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 522203629, now seen corresponding path program 3 times [2018-01-28 21:08:12,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:08:12,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:08:12,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:12,297 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:08:12,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:08:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:08:12,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:08:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 21:08:12,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:08:12,603 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-28 21:08:12,607 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:08:12,619 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:08:12,623 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:08:12,627 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:08:12,631 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:08:12,633 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:08:12,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:08:12,640 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-28 21:08:12,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:08:12,649 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-28 21:08:12,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:12,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:08:12,655 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-28 21:08:12,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:08:12,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 21:08:12,677 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-28 21:08:12,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-28 21:08:12,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-28 21:08:12,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:08:12,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:08:12,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-28 21:08:12,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:08:12,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:08:12,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-28 21:08:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 21:08:12,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 21:08:12,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:08:12,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:08:12,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:08:12,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-28 21:08:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:08:12,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:08:12,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-01-28 21:08:12,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:08:12,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:08:12,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:08:12,862 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 17 states. [2018-01-28 21:08:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:08:13,149 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-01-28 21:08:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:08:13,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-01-28 21:08:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:08:13,150 INFO L225 Difference]: With dead ends: 61 [2018-01-28 21:08:13,150 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:08:13,151 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:08:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:08:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:08:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:08:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:08:13,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-28 21:08:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:08:13,152 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:08:13,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:08:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:08:13,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:08:13,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:08:13,378 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 88 DAG size of output 45 [2018-01-28 21:08:13,927 WARN L146 SmtUtils]: Spent 467ms on a formula simplification. DAG size of input: 171 DAG size of output 104 [2018-01-28 21:08:13,930 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 21:08:13,931 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-28 21:08:13,932 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-28 21:08:13,933 INFO L395 ceAbstractionStarter]: At program point L557'(line 557) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~4.base)) (.cse1 (select |#length| |main_#t~malloc7.base|))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ .cse0 (+ main_~nondetString~4.offset (- 1))))) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= main_~length2~4 .cse0) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-28 21:08:13,933 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542'''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542'''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542''''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,934 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point L542'''''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L395 ceAbstractionStarter]: At program point L542''''''''''''(line 542) the Hoare annotation is: (let ((.cse9 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse5 (select |#length| cstpcpy_~to.base)) (.cse8 (+ .cse9 (- 1))) (.cse12 (select |#memory_int| cstpcpy_~from.base)) (.cse4 (select |#length| cstpcpy_~from.base))) (let ((.cse2 (= 1 (select |#valid| cstpcpy_~to.base))) (.cse3 (= 1 (select |#valid| cstpcpy_~from.base))) (.cse6 (= 0 (select .cse12 (+ .cse4 (- 1))))) (.cse7 (not (= cstpcpy_~to.base |cstpcpy_#in~from.base|))) (.cse0 (<= 1 cstpcpy_~from.offset)) (.cse1 (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) .cse8))) (.cse10 (not (= cstpcpy_~from.base cstpcpy_~to.base))) (.cse11 (<= .cse4 .cse5))) (or (and .cse0 .cse1 .cse2 (<= 2 cstpcpy_~to.offset) .cse3 (not (= cstpcpy_~to.base cstpcpy_~from.base)) (<= (+ cstpcpy_~from.offset 1) .cse4) (<= (+ .cse4 cstpcpy_~to.offset) (+ .cse5 cstpcpy_~from.offset)) .cse6 .cse7) (not (= 0 |cstpcpy_#in~from.offset|)) (not (= 1 (select |#valid| |cstpcpy_#in~from.base|))) (not (= 0 (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) .cse8))) (and .cse2 .cse3 .cse6 .cse7 (= cstpcpy_~from.offset 0) .cse1 (= cstpcpy_~to.offset 0) (<= .cse9 .cse5) .cse10 (<= 1 .cse4) .cse11) (not (= (select |#valid| |cstpcpy_#in~to.base|) 1)) (not (= |cstpcpy_#in~to.offset| 0)) (not (exists ((main_~length2~4 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 |cstpcpy_#in~from.offset| (- 1))) 0) (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstpcpy_#in~from.offset|) (select |#length| |cstpcpy_#in~from.base|))))) (and .cse2 (exists ((cstpcpy_~to.base Int) (cstpcpy_~to.offset Int)) (and (= (select (select |#memory_int| cstpcpy_~from.base) (+ cstpcpy_~from.offset (- 1))) (select (select |#memory_int| cstpcpy_~to.base) cstpcpy_~to.offset)) (not (= cstpcpy_~from.base cstpcpy_~to.base)))) .cse3 (or (= 1 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 2) .cse4)) .cse6 (not (= (select .cse12 (+ cstpcpy_~from.offset (- 1))) 0)) .cse7 .cse0 (exists ((main_~length2~4 Int)) (and (<= (+ main_~length2~4 cstpcpy_~from.offset) (+ (select |#length| cstpcpy_~from.base) 1)) (<= 1 main_~length2~4) (= 0 (select (select |#memory_int| cstpcpy_~from.base) (+ main_~length2~4 cstpcpy_~from.offset (- 2)))))) .cse1 .cse10 .cse11 (= 1 cstpcpy_~to.offset)) (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|) (< (select |#length| |cstpcpy_#in~to.base|) .cse9))))) [2018-01-28 21:08:13,935 INFO L395 ceAbstractionStarter]: At program point cstpcpyENTRY(lines 540 544) the Hoare annotation is: (let ((.cse1 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse0 (+ .cse1 (- 1)))) (or (not (= 0 |cstpcpy_#in~from.offset|)) (not (= 1 (select |#valid| |cstpcpy_#in~from.base|))) (not (= 0 (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) .cse0))) (not (= (select |#valid| |cstpcpy_#in~to.base|) 1)) (not (= |cstpcpy_#in~to.offset| 0)) (not (exists ((main_~length2~4 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 |cstpcpy_#in~from.offset| (- 1))) 0) (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstpcpy_#in~from.offset|) (select |#length| |cstpcpy_#in~from.base|))))) (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|) (< (select |#length| |cstpcpy_#in~to.base|) .cse1) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) .cse0))))) [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed. [2018-01-28 21:08:13,935 INFO L399 ceAbstractionStarter]: For program point L542''''''''''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,936 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-28 21:08:13,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] [2018-01-28 21:08:13,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,950 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,950 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,958 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,959 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] [2018-01-28 21:08:13,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,973 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:08:13 BoogieIcfgContainer [2018-01-28 21:08:13,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:08:13,983 INFO L168 Benchmark]: Toolchain (without parser) took 12683.27 ms. Allocated memory was 300.4 MB in the beginning and 586.7 MB in the end (delta: 286.3 MB). Free memory was 258.3 MB in the beginning and 485.6 MB in the end (delta: -227.3 MB). Peak memory consumption was 243.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:08:13,984 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.4 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:08:13,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 300.4 MB. Free memory was 257.3 MB in the beginning and 247.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:08:13,985 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:08:13,985 INFO L168 Benchmark]: RCFGBuilder took 226.83 ms. Allocated memory is still 300.4 MB. Free memory was 245.2 MB in the beginning and 227.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:08:13,985 INFO L168 Benchmark]: TraceAbstraction took 12212.19 ms. Allocated memory was 300.4 MB in the beginning and 586.7 MB in the end (delta: 286.3 MB). Free memory was 227.2 MB in the beginning and 485.6 MB in the end (delta: -258.4 MB). Peak memory consumption was 212.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:08:13,987 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.19 ms. Allocated memory is still 300.4 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 300.4 MB. Free memory was 257.3 MB in the beginning and 247.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.83 ms. Allocated memory is still 300.4 MB. Free memory was 245.2 MB in the beginning and 227.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12212.19 ms. Allocated memory was 300.4 MB in the beginning and 586.7 MB in the end (delta: 286.3 MB). Free memory was 227.2 MB in the beginning and 485.6 MB in the end (delta: -258.4 MB). Peak memory consumption was 212.1 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_~length2~4,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_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.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[main_~length2~4,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_~length2~4,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_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.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[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 545]: 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-28 21:08:13,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] [2018-01-28 21:08:13,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:13,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:13,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:13,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:13,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:14,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED] [2018-01-28 21:08:14,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED] [2018-01-28 21:08:14,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:08:14,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:08:14,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((1 <= from && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && 1 == \valid[to]) && 2 <= to) && 1 == \valid[from]) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] + to <= unknown-#length-unknown[to] + from) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(to == from)) || !(0 == from)) || !(1 == \valid[from])) || !(0 == \old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + -1])) || ((((((((((1 == \valid[to] && 1 == \valid[from]) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(to == from)) && from == 0) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && to == 0) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && !(from == to)) && 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to])) || !(\valid[to] == 1)) || !(to == 0)) || !(\exists main_~length2~4 : int :: (\old(unknown-#memory_int-unknown)[from][main_~length2~4 + from + -1] == 0 && 1 <= main_~length2~4) && main_~length2~4 + from <= unknown-#length-unknown[from])) || ((((((((((((1 == \valid[to] && (\exists cstpcpy_~to.base : int, cstpcpy_~to.offset : int :: unknown-#memory_int-unknown[from][from + -1] == unknown-#memory_int-unknown[cstpcpy_~to.base][cstpcpy_~to.offset] && !(from == cstpcpy_~to.base))) && 1 == \valid[from]) && (1 == from || from + 2 <= unknown-#length-unknown[from])) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(unknown-#memory_int-unknown[from][from + -1] == 0)) && !(to == from)) && 1 <= from) && (\exists main_~length2~4 : int :: (main_~length2~4 + from <= unknown-#length-unknown[from] + 1 && 1 <= main_~length2~4) && 0 == unknown-#memory_int-unknown[from][main_~length2~4 + from + -2])) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(from == to)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && 1 == to)) || from == to) || unknown-#length-unknown[to] < unknown-#length-unknown[from] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 7 error locations. SAFE Result, 12.1s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 532 SDtfs, 956 SDslu, 3186 SDs, 0 SdLazy, 2381 SolverSat, 204 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 183 SyntacticMatches, 15 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=9, 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, 13 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 502 HoareAnnotationTreeSize, 7 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 880 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 631 ConstructedInterpolants, 23 QuantifiedInterpolants, 257026 SizeOfPredicates, 56 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 13/152 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_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-08-14-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-08-14-023.csv Received shutdown request...