java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:50:12,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:50:12,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:50:12,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:50:12,601 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:50:12,602 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:50:12,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:50:12,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:50:12,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:50:12,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:50:12,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:50:12,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:50:12,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:50:12,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:50:12,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:50:12,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:50:12,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:50:12,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:50:12,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:50:12,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:50:12,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:50:12,617 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:50:12,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:50:12,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:50:12,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:50:12,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:50:12,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:50:12,620 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:50:12,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:50:12,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:50:12,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:50:12,621 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:50:12,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:50:12,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:50:12,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:50:12,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:50:12,632 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:50:12,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:50:12,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:50:12,632 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:50:12,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:50:12,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:50:12,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:50:12,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:50:12,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:50:12,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:50:12,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:50:12,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:50:12,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:50:12,634 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:50:12,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:50:12,635 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:50:12,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:50:12,670 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:50:12,675 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:50:12,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:50:12,676 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:50:12,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:12,813 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:50:12,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:50:12,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:12,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:50:12,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:50:12,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12, skipping insertion in model container [2018-02-03 22:50:12,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,837 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:12,864 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:12,951 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:12,962 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:12,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12 WrapperNode [2018-02-03 22:50:12,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:12,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:50:12,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:50:12,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:50:12,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... [2018-02-03 22:50:12,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:50:12,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:50:12,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:50:12,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:50:12,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:50:13,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:50:13,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:50:13,028 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-02-03 22:50:13,028 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:50:13,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:50:13,147 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:50:13,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:13 BoogieIcfgContainer [2018-02-03 22:50:13,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:50:13,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:50:13,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:50:13,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:50:13,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:50:12" (1/3) ... [2018-02-03 22:50:13,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1162f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:13, skipping insertion in model container [2018-02-03 22:50:13,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:12" (2/3) ... [2018-02-03 22:50:13,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1162f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:13, skipping insertion in model container [2018-02-03 22:50:13,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:13" (3/3) ... [2018-02-03 22:50:13,151 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:13,156 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:50:13,160 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-03 22:50:13,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:50:13,191 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:50:13,191 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:50:13,191 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:50:13,191 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:50:13,191 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:50:13,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:50:13,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:50:13,192 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:50:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-03 22:50:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-03 22:50:13,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,213 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,213 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-02-03 22:50:13,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:13,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:13,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:50:13,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:50:13,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:50:13,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:50:13,363 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-02-03 22:50:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:13,443 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-03 22:50:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:50:13,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-03 22:50:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:13,491 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:50:13,491 INFO L226 Difference]: Without dead ends: 37 [2018-02-03 22:50:13,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:50:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-03 22:50:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-03 22:50:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:50:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-03 22:50:13,512 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-03 22:50:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:13,513 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-03 22:50:13,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:50:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-03 22:50:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:50:13,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,513 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,513 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-02-03 22:50:13,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:13,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:13,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:50:13,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:50:13,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:50:13,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:50:13,567 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-03 22:50:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:13,603 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-03 22:50:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:50:13,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:50:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:13,605 INFO L225 Difference]: With dead ends: 36 [2018-02-03 22:50:13,605 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:50:13,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:50:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-03 22:50:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:50:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:50:13,609 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-03 22:50:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:13,610 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:50:13,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:50:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:50:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:50:13,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,610 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,610 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-02-03 22:50:13,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:13,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:13,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:50:13,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:50:13,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:50:13,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:13,692 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-03 22:50:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:13,744 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-03 22:50:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:13,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:50:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:13,745 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:50:13,745 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:50:13,746 INFO L554 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-02-03 22:50:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:50:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:50:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:50:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-03 22:50:13,749 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-03 22:50:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:13,749 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-03 22:50:13,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:50:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-03 22:50:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:50:13,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,750 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-02-03 22:50:13,751 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:13,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:13,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:50:13,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:50:13,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:50:13,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:13,802 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-03 22:50:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:13,835 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-03 22:50:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:50:13,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 22:50:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:13,836 INFO L225 Difference]: With dead ends: 34 [2018-02-03 22:50:13,836 INFO L226 Difference]: Without dead ends: 34 [2018-02-03 22:50:13,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-03 22:50:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-03 22:50:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-03 22:50:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-03 22:50:13,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-03 22:50:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:13,839 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-03 22:50:13,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:50:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-03 22:50:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:50:13,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,839 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-02-03 22:50:13,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,840 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:13,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:13,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:13,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:13,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:13,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:13,915 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-03 22:50:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:13,978 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:50:13,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:50:13,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-03 22:50:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:13,981 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:50:13,981 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 22:50:13,981 INFO L554 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-02-03 22:50:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 22:50:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-03 22:50:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:50:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:50:13,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-03 22:50:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:13,984 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:50:13,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:50:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:50:13,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:13,985 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:13,985 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-02-03 22:50:13,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:13,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:13,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:13,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:13,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:14,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:14,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:14,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:14,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:14,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:14,054 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-02-03 22:50:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:14,106 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-03 22:50:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:14,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 22:50:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:14,107 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:50:14,107 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:50:14,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:50:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:50:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:50:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:50:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-03 22:50:14,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-03 22:50:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:14,109 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-03 22:50:14,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-03 22:50:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:50:14,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:14,109 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:14,109 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-02-03 22:50:14,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:14,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:14,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:14,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:14,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:14,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:14,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:14,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:14,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:14,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:14,203 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-02-03 22:50:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:14,295 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-03 22:50:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:50:14,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 22:50:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:14,295 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:50:14,295 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:50:14,296 INFO L554 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-02-03 22:50:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:50:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-02-03 22:50:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:50:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:50:14,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-03 22:50:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:14,298 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:50:14,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:50:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:50:14,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:14,298 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:14,298 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-02-03 22:50:14,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:14,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:14,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:14,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:14,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:14,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:14,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:50:14,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:50:14,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:50:14,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:50:14,410 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-02-03 22:50:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:14,601 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-02-03 22:50:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:50:14,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-03 22:50:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:14,603 INFO L225 Difference]: With dead ends: 74 [2018-02-03 22:50:14,603 INFO L226 Difference]: Without dead ends: 74 [2018-02-03 22:50:14,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:50:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-03 22:50:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-02-03 22:50:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:50:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-03 22:50:14,610 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-02-03 22:50:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:14,610 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-03 22:50:14,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:50:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-03 22:50:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:50:14,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:14,611 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:14,611 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-02-03 22:50:14,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:14,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:14,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,613 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:14,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:14,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:14,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:50:14,728 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:50:14,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:14,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:50:14,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:50:14,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:50:14,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:14,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:14,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:50:14,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:50:14,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-03 22:50:14,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:50:14,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:50:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:50:14,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:50:14,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-03 22:50:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:14,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:50:14,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-02-03 22:50:14,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 22:50:14,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 22:50:14,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:50:14,955 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2018-02-03 22:50:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:15,200 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-03 22:50:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:50:15,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-02-03 22:50:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:15,201 INFO L225 Difference]: With dead ends: 66 [2018-02-03 22:50:15,201 INFO L226 Difference]: Without dead ends: 66 [2018-02-03 22:50:15,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:50:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-03 22:50:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-03 22:50:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 22:50:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-03 22:50:15,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-02-03 22:50:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:15,204 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-03 22:50:15,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 22:50:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-03 22:50:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:15,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:15,205 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:15,205 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-02-03 22:50:15,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:15,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:15,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:15,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:15,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:15,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:15,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:50:15,363 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:50:15,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:15,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:50:15,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:50:15,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:50:15,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-03 22:50:15,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:50:15,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:50:15,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:50:15,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:50:15,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:15,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-03 22:50:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:15,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:50:15,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-03 22:50:15,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:50:15,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:50:15,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:50:15,617 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 22 states. [2018-02-03 22:50:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:16,017 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-03 22:50:16,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:50:16,017 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-02-03 22:50:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:16,018 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:50:16,018 INFO L226 Difference]: Without dead ends: 64 [2018-02-03 22:50:16,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:50:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-03 22:50:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-02-03 22:50:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:50:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-03 22:50:16,023 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-02-03 22:50:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:16,023 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-03 22:50:16,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:50:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-03 22:50:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:50:16,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:16,024 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:16,024 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-02-03 22:50:16,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:16,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:16,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:16,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:16,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:16,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:16,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:50:16,265 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:50:16,270 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:50:16,284 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:50:16,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:50:16,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:50:16,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:50:16,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:50:16,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:50:16,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:50:16,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:50:16,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:50:16,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:50:16,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:50:16,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:50:16,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-03 22:50:16,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:50:16,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 22:50:16,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:16,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:50:16,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-03 22:50:16,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:50:16,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:50:16,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:50:16,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:50:16,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:50:16,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-03 22:50:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:16,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:50:16,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-02-03 22:50:16,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 22:50:16,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 22:50:16,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-02-03 22:50:16,499 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2018-02-03 22:50:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:16,989 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-03 22:50:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:50:16,989 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-02-03 22:50:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:16,989 INFO L225 Difference]: With dead ends: 63 [2018-02-03 22:50:16,990 INFO L226 Difference]: Without dead ends: 63 [2018-02-03 22:50:16,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-02-03 22:50:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-03 22:50:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-02-03 22:50:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:50:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-03 22:50:16,993 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2018-02-03 22:50:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:16,993 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-03 22:50:16,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 22:50:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-03 22:50:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:50:16,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:16,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:16,994 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-03 22:50:16,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-02-03 22:50:16,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:16,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:16,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:16,995 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:50:16,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:17,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:17,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:17,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:17,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:17,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:17,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:17,055 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-02-03 22:50:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:17,132 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-02-03 22:50:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:50:17,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-03 22:50:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:17,132 INFO L225 Difference]: With dead ends: 46 [2018-02-03 22:50:17,132 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:50:17,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:50:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:50:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:50:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:50:17,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-02-03 22:50:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:17,133 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:50:17,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:50:17,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:50:17,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:50:17 BoogieIcfgContainer [2018-02-03 22:50:17,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:50:17,137 INFO L168 Benchmark]: Toolchain (without parser) took 4323.36 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 355.9 MB in the beginning and 692.7 MB in the end (delta: -336.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:50:17,138 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:50:17,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.87 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 345.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:17,138 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 397.9 MB. Free memory was 345.3 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:17,138 INFO L168 Benchmark]: RCFGBuilder took 153.84 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 325.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:17,138 INFO L168 Benchmark]: TraceAbstraction took 3988.68 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 325.5 MB in the beginning and 692.7 MB in the end (delta: -367.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:50:17,139 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.13 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.87 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 345.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 397.9 MB. Free memory was 345.3 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 153.84 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 325.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3988.68 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 325.5 MB in the beginning and 692.7 MB in the end (delta: -367.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 3.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 480 SDslu, 1447 SDs, 0 SdLazy, 1400 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 299 ConstructedInterpolants, 13 QuantifiedInterpolants, 51740 SizeOfPredicates, 27 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 2/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-50-17-146.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-50-17-146.csv Received shutdown request...