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_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:54:43,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:54:43,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:54:43,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:54:43,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:54:43,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:54:43,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:54:43,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:54:43,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:54:43,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:54:43,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:54:43,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:54:43,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:54:43,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:54:43,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:54:43,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:54:43,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:54:43,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:54:43,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:54:43,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:54:43,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:54:43,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:54:43,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:54:43,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:54:43,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:54:43,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:54:43,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:54:43,637 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:54:43,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:54:43,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:54:43,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:54:43,638 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:54:43,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:54:43,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:54:43,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:54:43,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:54:43,648 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:54:43,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:54:43,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:54:43,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:54:43,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:54:43,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:54:43,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:54:43,683 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:54:43,685 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:54:43,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:54:43,686 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:54:43,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:54:43,813 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:54:43,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:54:43,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:43,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:54:43,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:54:43,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c9c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43, skipping insertion in model container [2018-02-03 22:54:43,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,831 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:43,858 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:43,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:43,961 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:43,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43 WrapperNode [2018-02-03 22:54:43,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:43,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:54:43,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:54:43,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:54:43,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:54:43" (1/1) ... [2018-02-03 22:54:43,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,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:54:43" (1/1) ... [2018-02-03 22:54:43,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (1/1) ... [2018-02-03 22:54:43,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:54:43,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:54:43,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:54:43,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:54:43,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (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:54:44,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:54:44,040 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:54:44,040 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-03 22:54:44,040 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:54:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:54:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:54:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:54:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:54:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:54:44,181 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:54:44,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:44 BoogieIcfgContainer [2018-02-03 22:54:44,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:54:44,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:54:44,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:54:44,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:54:44,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:54:43" (1/3) ... [2018-02-03 22:54:44,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a34ba0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:54:44, skipping insertion in model container [2018-02-03 22:54:44,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:43" (2/3) ... [2018-02-03 22:54:44,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a34ba0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:54:44, skipping insertion in model container [2018-02-03 22:54:44,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:44" (3/3) ... [2018-02-03 22:54:44,186 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:54:44,191 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:54:44,195 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-03 22:54:44,228 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:54:44,228 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:54:44,228 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:54:44,229 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:54:44,229 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:54:44,229 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:54:44,229 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:54:44,229 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:54:44,229 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:54:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-03 22:54:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:54:44,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:44,245 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:44,245 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-02-03 22:54:44,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:44,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:44,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:44,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:44,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:44,417 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:54:44,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:44,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:44,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:54:44,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:54:44,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:54:44,435 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-03 22:54:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:44,556 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:54:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:54:44,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:54:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:44,565 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:54:44,565 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:54:44,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:54:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:54:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-03 22:54:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-03 22:54:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-03 22:54:44,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-03 22:54:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:44,591 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-03 22:54:44,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:54:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-03 22:54:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:54:44,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:44,591 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:44,592 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:44,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-02-03 22:54:44,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:44,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:44,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:44,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:44,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:44,673 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:54:44,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:44,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:54:44,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:54:44,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:54:44,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:54:44,675 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-03 22:54:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:44,730 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-03 22:54:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:54:44,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:54:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:44,731 INFO L225 Difference]: With dead ends: 40 [2018-02-03 22:54:44,731 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:54:44,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:54:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:54:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-03 22:54:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-03 22:54:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-03 22:54:44,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-03 22:54:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:44,739 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-03 22:54:44,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:54:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-03 22:54:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:54:44,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:44,740 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:44,740 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-02-03 22:54:44,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:44,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:44,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:44,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:44,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:44,777 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:54:44,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:44,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:44,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:54:44,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:54:44,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:54:44,778 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-03 22:54:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:44,810 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-03 22:54:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:54:44,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:54:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:44,810 INFO L225 Difference]: With dead ends: 39 [2018-02-03 22:54:44,810 INFO L226 Difference]: Without dead ends: 39 [2018-02-03 22:54:44,811 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:54:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-03 22:54:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-03 22:54:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-03 22:54:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-03 22:54:44,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-03 22:54:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:44,813 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-03 22:54:44,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:54:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-03 22:54:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:54:44,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:44,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:44,814 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-02-03 22:54:44,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:44,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:44,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:44,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:44,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:44,879 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:54:44,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:44,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:54:44,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:54:44,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:54:44,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:54:44,880 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-03 22:54:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:44,914 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-03 22:54:44,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:54:44,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:54:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:44,915 INFO L225 Difference]: With dead ends: 38 [2018-02-03 22:54:44,915 INFO L226 Difference]: Without dead ends: 38 [2018-02-03 22:54:44,915 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:54:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-03 22:54:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-03 22:54:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-03 22:54:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-03 22:54:44,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-03 22:54:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:44,917 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-03 22:54:44,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:54:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-03 22:54:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:54:44,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:44,918 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:54:44,918 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-02-03 22:54:44,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:44,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:44,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:44,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:44,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:44,969 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:54:44,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:44,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:54:44,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:54:44,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:54:44,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:54:44,970 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-03 22:54:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:45,013 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-03 22:54:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:54:45,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-03 22:54:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:45,014 INFO L225 Difference]: With dead ends: 37 [2018-02-03 22:54:45,014 INFO L226 Difference]: Without dead ends: 37 [2018-02-03 22:54:45,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:54:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-03 22:54:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-03 22:54:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:54:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-03 22:54:45,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-02-03 22:54:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:45,016 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-03 22:54:45,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:54:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-03 22:54:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:54:45,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:45,018 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:54:45,018 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-02-03 22:54:45,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:45,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:45,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:45,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:45,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:45,103 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:54:45,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:45,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:54:45,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:54:45,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:54:45,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:54:45,104 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-03 22:54:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:45,179 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-03 22:54:45,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:54:45,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-03 22:54:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:45,180 INFO L225 Difference]: With dead ends: 40 [2018-02-03 22:54:45,180 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:54:45,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:54:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:54:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-03 22:54:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-03 22:54:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-03 22:54:45,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-03 22:54:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:45,184 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-03 22:54:45,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:54:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-03 22:54:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:54:45,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:45,184 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] [2018-02-03 22:54:45,185 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-02-03 22:54:45,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:45,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:45,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:45,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:45,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:45,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-02-03 22:54:45,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:45,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:54:45,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:54:45,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:54:45,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:54:45,229 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-02-03 22:54:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:45,287 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-03 22:54:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:54:45,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-03 22:54:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:45,288 INFO L225 Difference]: With dead ends: 39 [2018-02-03 22:54:45,288 INFO L226 Difference]: Without dead ends: 39 [2018-02-03 22:54:45,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:54:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-03 22:54:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-02-03 22:54:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-03 22:54:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-03 22:54:45,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-02-03 22:54:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:45,291 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-03 22:54:45,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:54:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-03 22:54:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:54:45,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:45,292 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] [2018-02-03 22:54:45,292 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-02-03 22:54:45,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:45,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:45,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:45,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:45,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:45,376 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:54:45,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:45,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 22:54:45,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:54:45,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:54:45,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:54:45,377 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-02-03 22:54:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:45,463 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-03 22:54:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:54:45,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-03 22:54:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:45,464 INFO L225 Difference]: With dead ends: 42 [2018-02-03 22:54:45,464 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:54:45,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:54:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:54:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-02-03 22:54:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-03 22:54:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-03 22:54:45,466 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-02-03 22:54:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:45,467 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-03 22:54:45,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:54:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-03 22:54:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:54:45,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:45,468 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:45,468 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-02-03 22:54:45,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:45,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:45,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:45,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:45,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:45,669 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:54:45,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:45,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-03 22:54:45,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 22:54:45,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 22:54:45,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:54:45,670 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 14 states. [2018-02-03 22:54:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:45,868 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-03 22:54:45,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:54:45,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-03 22:54:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:45,869 INFO L225 Difference]: With dead ends: 72 [2018-02-03 22:54:45,869 INFO L226 Difference]: Without dead ends: 72 [2018-02-03 22:54:45,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-03 22:54:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-03 22:54:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-02-03 22:54:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 22:54:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-03 22:54:45,873 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 26 [2018-02-03 22:54:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:45,873 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-03 22:54:45,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 22:54:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-03 22:54:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:54:45,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:45,874 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:45,874 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1264212731, now seen corresponding path program 1 times [2018-02-03 22:54:45,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:45,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:45,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:45,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:45,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:46,011 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:54:46,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:46,011 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:54:46,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:46,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:46,081 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:54:46,083 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:54:46,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:46,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:46,089 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:54:46,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:54:46,240 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:54:46,246 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:54:46,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:46,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:46,257 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:54:46,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:54:46,314 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:54:46,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:46,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-02-03 22:54:46,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-03 22:54:46,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-03 22:54:46,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:54:46,339 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 21 states. [2018-02-03 22:54:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:48,314 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-03 22:54:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:54:48,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-02-03 22:54:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:48,317 INFO L225 Difference]: With dead ends: 86 [2018-02-03 22:54:48,317 INFO L226 Difference]: Without dead ends: 86 [2018-02-03 22:54:48,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=949, Unknown=1, NotChecked=0, Total=1122 [2018-02-03 22:54:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-03 22:54:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-02-03 22:54:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 22:54:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-03 22:54:48,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2018-02-03 22:54:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:48,322 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-03 22:54:48,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-03 22:54:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-03 22:54:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:54:48,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:48,323 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:48,324 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash 446562103, now seen corresponding path program 1 times [2018-02-03 22:54:48,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:48,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:48,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:48,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:48,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:48,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:48,607 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:54:48,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:48,607 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:54:48,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:48,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:48,651 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:54:48,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:54:48,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:48,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:48,685 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:54:48,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:54:48,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:54:48,720 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:54:48,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,726 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:54:48,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:54:48,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-03 22:54:48,752 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:54:48,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:48,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:54:48,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-03 22:54:48,905 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:54:48,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:48,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 22:54:48,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:48,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:48,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:48,922 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-03 22:54:48,998 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:54:49,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:49,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-02-03 22:54:49,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:54:49,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:54:49,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:54:49,015 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 28 states. [2018-02-03 22:54:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:49,823 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-03 22:54:49,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 22:54:49,823 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2018-02-03 22:54:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:49,824 INFO L225 Difference]: With dead ends: 92 [2018-02-03 22:54:49,824 INFO L226 Difference]: Without dead ends: 92 [2018-02-03 22:54:49,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:54:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-03 22:54:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-03 22:54:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-03 22:54:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-03 22:54:49,830 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 26 [2018-02-03 22:54:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:49,831 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-03 22:54:49,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:54:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-03 22:54:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:54:49,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:49,832 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, 1, 1, 1] [2018-02-03 22:54:49,832 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -53536959, now seen corresponding path program 2 times [2018-02-03 22:54:49,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:49,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:49,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:49,833 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:49,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:49,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:50,143 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:54:50,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:50,143 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:54:50,152 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:50,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:50,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:50,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:50,199 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:54:50,201 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:54:50,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:50,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:50,208 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:54:50,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:54:50,486 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 30 treesize of output 24 [2018-02-03 22:54:50,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:50,492 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 24 treesize of output 35 [2018-02-03 22:54:50,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:50,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:50,510 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:54:50,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-02-03 22:54:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:50,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:50,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-03 22:54:50,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 22:54:50,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 22:54:50,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2018-02-03 22:54:50,597 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 27 states. [2018-02-03 22:54:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:53,446 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-02-03 22:54:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 22:54:53,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2018-02-03 22:54:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:53,448 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:54:53,448 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 22:54:53,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:54:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 22:54:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2018-02-03 22:54:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-03 22:54:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-02-03 22:54:53,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 31 [2018-02-03 22:54:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:53,452 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-02-03 22:54:53,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 22:54:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-02-03 22:54:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:54:53,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:53,452 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:53,452 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1129910615, now seen corresponding path program 1 times [2018-02-03 22:54:53,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:53,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:53,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:53,453 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:53,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:53,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:53,556 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:54:53,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:53,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:54:53,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:54:53,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:54:53,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:54:53,557 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 7 states. [2018-02-03 22:54:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:53,626 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-03 22:54:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:54:53,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-03 22:54:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:53,627 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:54:53,627 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:54:53,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:54:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:54:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:54:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:54:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-02-03 22:54:53,628 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-02-03 22:54:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:53,628 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-02-03 22:54:53,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:54:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-02-03 22:54:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:54:53,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:53,629 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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:54:53,629 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-03 22:54:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -373803070, now seen corresponding path program 2 times [2018-02-03 22:54:53,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:53,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:53,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:53,629 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:53,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:53,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:53,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:53,876 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:53,882 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:53,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:53,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:53,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:53,902 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:54:53,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,907 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:54:53,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:54:53,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:53,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:53,953 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:54:53,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,964 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:54:53,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:53,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-03 22:54:54,009 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:54:54,010 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:54:54,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:54,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:54,016 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:54:54,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-03 22:54:54,041 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-02-03 22:54:54,042 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:54:54,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:54,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:54,051 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:54:54,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-02-03 22:54:54,561 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 48 treesize of output 42 [2018-02-03 22:54:54,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:54:54,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:54,575 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 21 treesize of output 13 [2018-02-03 22:54:54,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:54,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:54,603 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 2 xjuncts. [2018-02-03 22:54:54,603 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:69 [2018-02-03 22:54:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:54,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:54,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 39 [2018-02-03 22:54:54,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 22:54:54,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 22:54:54,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-02-03 22:54:54,814 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 40 states. [2018-02-03 22:54:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:57,631 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-03 22:54:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-03 22:54:57,645 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 34 [2018-02-03 22:54:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:57,645 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:54:57,645 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:54:57,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=563, Invalid=4987, Unknown=0, NotChecked=0, Total=5550 [2018-02-03 22:54:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:54:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:54:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:54:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:54:57,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-03 22:54:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:57,646 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:54:57,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-03 22:54:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:54:57,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:54:57,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:54:57 BoogieIcfgContainer [2018-02-03 22:54:57,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:54:57,650 INFO L168 Benchmark]: Toolchain (without parser) took 13835.98 ms. Allocated memory was 399.5 MB in the beginning and 751.3 MB in the end (delta: 351.8 MB). Free memory was 356.0 MB in the beginning and 579.9 MB in the end (delta: -223.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:57,650 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.5 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:54:57,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 399.5 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:57,651 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 399.5 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:57,651 INFO L168 Benchmark]: RCFGBuilder took 185.36 ms. Allocated memory is still 399.5 MB. Free memory was 344.1 MB in the beginning and 325.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:57,651 INFO L168 Benchmark]: TraceAbstraction took 13467.07 ms. Allocated memory was 399.5 MB in the beginning and 751.3 MB in the end (delta: 351.8 MB). Free memory was 324.2 MB in the beginning and 579.9 MB in the end (delta: -255.7 MB). Peak memory consumption was 96.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:57,652 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.10 ms. Allocated memory is still 399.5 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 399.5 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 399.5 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.36 ms. Allocated memory is still 399.5 MB. Free memory was 344.1 MB in the beginning and 325.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13467.07 ms. Allocated memory was 399.5 MB in the beginning and 751.3 MB in the end (delta: 351.8 MB). Free memory was 324.2 MB in the beginning and 579.9 MB in the end (delta: -255.7 MB). Peak memory consumption was 96.1 MB. 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: 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: 552]: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. SAFE Result, 13.4s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 988 SDslu, 2101 SDs, 0 SdLazy, 2649 SolverSat, 308 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=11, 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, 14 MinimizatonAttempts, 72 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 406 ConstructedInterpolants, 45 QuantifiedInterpolants, 132138 SizeOfPredicates, 66 NumberOfNonLiveVariables, 615 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 7/52 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_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-54-57-656.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-54-57-656.csv Received shutdown request...