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_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:25:58,572 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:25:58,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:25:58,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:25:58,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:25:58,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:25:58,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:25:58,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:25:58,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:25:58,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:25:58,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:25:58,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:25:58,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:25:58,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:25:58,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:25:58,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:25:58,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:25:58,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:25:58,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:25:58,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:25:58,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:25:58,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:25:58,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:25:58,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:25:58,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:25:58,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:25:58,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:25:58,599 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:25:58,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:25:58,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:25:58,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:25:58,599 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-02 18:25:58,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:25:58,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:25:58,608 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:25:58,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:25:58,608 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:25:58,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:25:58,608 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:25:58,608 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:25:58,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:25:58,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:25:58,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:25:58,610 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:25:58,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:25:58,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:25:58,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:25:58,641 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:25:58,644 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:25:58,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:25:58,646 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:25:58,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:25:58,832 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:25:58,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:25:58,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:25:58,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:25:58,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:25:58,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:58,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ee07db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58, skipping insertion in model container [2018-02-02 18:25:58,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:58,852 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:25:58,880 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:25:58,967 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:25:58,982 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:25:58,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58 WrapperNode [2018-02-02 18:25:58,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:25:58,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:25:58,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:25:58,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:25:58,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:58,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (1/1) ... [2018-02-02 18:25:59,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:25:59,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:25:59,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:25:59,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:25:59,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (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-02 18:25:59,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:25:59,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:25:59,055 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-02 18:25:59,055 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:25:59,055 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:25:59,055 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:25:59,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:25:59,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:25:59,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:25:59 BoogieIcfgContainer [2018-02-02 18:25:59,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:25:59,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:25:59,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:25:59,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:25:59,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:25:58" (1/3) ... [2018-02-02 18:25:59,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326092dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:25:59, skipping insertion in model container [2018-02-02 18:25:59,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:58" (2/3) ... [2018-02-02 18:25:59,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326092dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:25:59, skipping insertion in model container [2018-02-02 18:25:59,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:25:59" (3/3) ... [2018-02-02 18:25:59,189 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:25:59,194 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:25:59,198 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 18:25:59,228 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:25:59,229 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:25:59,229 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:25:59,229 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:25:59,229 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:25:59,229 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:25:59,229 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:25:59,230 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:25:59,230 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:25:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-02 18:25:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:25:59,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:59,247 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:59,248 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-02-02 18:25:59,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:59,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:59,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:59,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:59,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:59,414 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-02 18:25:59,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:59,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:25:59,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:25:59,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:25:59,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:25:59,432 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-02 18:25:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:59,557 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 18:25:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:25:59,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 18:25:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:59,564 INFO L225 Difference]: With dead ends: 44 [2018-02-02 18:25:59,564 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 18:25:59,565 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-02 18:25:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 18:25:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 18:25:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 18:25:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 18:25:59,588 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-02 18:25:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:59,588 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 18:25:59,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:25:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 18:25:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:25:59,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:59,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:59,589 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-02-02 18:25:59,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:59,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:59,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:59,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:59,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:59,670 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-02 18:25:59,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:59,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:59,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:59,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:59,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:59,673 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-02 18:25:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:59,805 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 18:25:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:25:59,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 18:25:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:59,806 INFO L225 Difference]: With dead ends: 40 [2018-02-02 18:25:59,807 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 18:25:59,807 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-02 18:25:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 18:25:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 18:25:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 18:25:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 18:25:59,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-02 18:25:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:59,810 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 18:25:59,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 18:25:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:25:59,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:59,810 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:59,810 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-02-02 18:25:59,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:59,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:59,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:59,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:59,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:59,840 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-02 18:25:59,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:59,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:25:59,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:25:59,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:25:59,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:25:59,840 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-02 18:25:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:59,867 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 18:25:59,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:25:59,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 18:25:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:59,868 INFO L225 Difference]: With dead ends: 39 [2018-02-02 18:25:59,868 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 18:25:59,868 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-02 18:25:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 18:25:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 18:25:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 18:25:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 18:25:59,872 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-02 18:25:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:59,872 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 18:25:59,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:25:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 18:25:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:25:59,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:59,873 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:59,873 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-02-02 18:25:59,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:59,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:59,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:59,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:59,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:59,933 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-02 18:25:59,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:59,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:25:59,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:25:59,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:25:59,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:25:59,934 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-02 18:25:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:59,954 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 18:25:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:25:59,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:25:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:59,955 INFO L225 Difference]: With dead ends: 38 [2018-02-02 18:25:59,955 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 18:25:59,955 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-02 18:25:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 18:25:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 18:25:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 18:25:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 18:25:59,957 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-02 18:25:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:59,957 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 18:25:59,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:25:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 18:25:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:25:59,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:59,957 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:59,957 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-02-02 18:25:59,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:59,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:59,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:59,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:59,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:59,997 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-02 18:25:59,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:59,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:59,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:59,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:59,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:59,998 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-02 18:26:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:00,062 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-02 18:26:00,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:26:00,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 18:26:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:00,063 INFO L225 Difference]: With dead ends: 37 [2018-02-02 18:26:00,063 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 18:26:00,063 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-02 18:26:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 18:26:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 18:26:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 18:26:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-02 18:26:00,066 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-02-02 18:26:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:00,066 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-02 18:26:00,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:26:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-02 18:26:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:26:00,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:00,067 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:26:00,067 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-02-02 18:26:00,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:00,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:00,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:00,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:00,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:00,171 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-02 18:26:00,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:26:00,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:26:00,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:26:00,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:26:00,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:26:00,172 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-02 18:26:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:00,252 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 18:26:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:26:00,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 18:26:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:00,252 INFO L225 Difference]: With dead ends: 41 [2018-02-02 18:26:00,252 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 18:26:00,252 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-02 18:26:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 18:26:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-02 18:26:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 18:26:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 18:26:00,254 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-02-02 18:26:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:00,254 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 18:26:00,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:26:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 18:26:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:26:00,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:00,255 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] [2018-02-02 18:26:00,255 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-02-02 18:26:00,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:00,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:00,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:00,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:00,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:00,291 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-02 18:26:00,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:26:00,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:26:00,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:26:00,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:26:00,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:26:00,293 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-02-02 18:26:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:00,358 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 18:26:00,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:26:00,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 18:26:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:00,359 INFO L225 Difference]: With dead ends: 40 [2018-02-02 18:26:00,359 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 18:26:00,359 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-02 18:26:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 18:26:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 18:26:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 18:26:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 18:26:00,361 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-02-02 18:26:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:00,361 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 18:26:00,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:26:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 18:26:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:26:00,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:00,362 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] [2018-02-02 18:26:00,362 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:00,362 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-02-02 18:26:00,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:00,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:00,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:00,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:00,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:00,453 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-02 18:26:00,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:26:00,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 18:26:00,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:26:00,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:26:00,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:26:00,454 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-02-02 18:26:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:00,546 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 18:26:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:26:00,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 18:26:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:00,546 INFO L225 Difference]: With dead ends: 43 [2018-02-02 18:26:00,547 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 18:26:00,547 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-02 18:26:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 18:26:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-02 18:26:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 18:26:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 18:26:00,549 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-02-02 18:26:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:00,549 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 18:26:00,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:26:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 18:26:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:26:00,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:00,549 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:26:00,550 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-02-02 18:26:00,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:00,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:00,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:00,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:00,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:00,651 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-02 18:26:00,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:26:00,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 18:26:00,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:26:00,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:26:00,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:26:00,652 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-02-02 18:26:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:00,880 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-02-02 18:26:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:26:00,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 18:26:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:00,881 INFO L225 Difference]: With dead ends: 79 [2018-02-02 18:26:00,881 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 18:26:00,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:26:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 18:26:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-02-02 18:26:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 18:26:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 18:26:00,886 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-02-02 18:26:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:00,886 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 18:26:00,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:26:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 18:26:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:26:00,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:00,887 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:26:00,887 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-02-02 18:26:00,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:00,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:00,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:00,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:00,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:01,045 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-02 18:26:01,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:01,046 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-02 18:26:01,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:01,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:01,105 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-02 18:26:01,110 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-02 18:26:01,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:01,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:01,116 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-02 18:26:01,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 18:26:01,262 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-02 18:26:01,267 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-02 18:26:01,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:01,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:01,277 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-02 18:26:01,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-02 18:26:01,329 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-02 18:26:01,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:01,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-02-02 18:26:01,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 18:26:01,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 18:26:01,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-02 18:26:01,347 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-02-02 18:26:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:02,682 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-02 18:26:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:26:02,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-02-02 18:26:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:02,684 INFO L225 Difference]: With dead ends: 78 [2018-02-02 18:26:02,685 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 18:26:02,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:26:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 18:26:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-02-02 18:26:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 18:26:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 18:26:02,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-02-02 18:26:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:02,688 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 18:26:02,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 18:26:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 18:26:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:26:02,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:02,689 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:26:02,689 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-02-02 18:26:02,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:02,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:02,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:02,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:02,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:02,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:03,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:03,045 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-02 18:26:03,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:03,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:03,081 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-02 18:26:03,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:26:03,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:03,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:03,122 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-02 18:26:03,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:26:03,153 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-02 18:26:03,155 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-02 18:26:03,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:26:03,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 18:26:03,187 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-02 18:26:03,189 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-02 18:26:03,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,197 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-02 18:26:03,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 18:26:03,332 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-02 18:26:03,335 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-02 18:26:03,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:03,355 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-02 18:26:03,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:03,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:03,371 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-02 18:26:03,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-02 18:26:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:03,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:03,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-02-02 18:26:03,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 18:26:03,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 18:26:03,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2018-02-02 18:26:03,473 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 28 states. [2018-02-02 18:26:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:04,433 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-02-02 18:26:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:26:04,433 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-02-02 18:26:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:04,434 INFO L225 Difference]: With dead ends: 100 [2018-02-02 18:26:04,434 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 18:26:04,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 18:26:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 18:26:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-02 18:26:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 18:26:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-02-02 18:26:04,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 28 [2018-02-02 18:26:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:04,442 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-02-02 18:26:04,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 18:26:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-02-02 18:26:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:26:04,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:04,443 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-02 18:26:04,443 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1759144044, now seen corresponding path program 1 times [2018-02-02 18:26:04,443 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:04,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:04,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:04,444 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:04,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:04,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:04,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:26:04,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:26:04,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:26:04,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:26:04,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:26:04,533 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2018-02-02 18:26:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:04,585 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-02 18:26:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:26:04,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 18:26:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:04,585 INFO L225 Difference]: With dead ends: 92 [2018-02-02 18:26:04,586 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 18:26:04,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:26:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 18:26:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 18:26:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 18:26:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-02 18:26:04,589 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2018-02-02 18:26:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:04,590 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-02 18:26:04,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:26:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-02 18:26:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:26:04,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:04,591 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, 1] [2018-02-02 18:26:04,591 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1832996809, now seen corresponding path program 2 times [2018-02-02 18:26:04,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:04,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:04,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:04,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:26:04,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:04,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:04,831 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-02 18:26:04,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:04,832 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-02 18:26:04,839 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:26:04,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:26:04,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:26:04,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:04,890 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-02 18:26:04,891 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-02 18:26:04,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:04,896 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-02 18:26:04,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 18:26:05,184 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-02 18:26:05,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:05,190 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-02 18:26:05,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:05,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:05,207 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-02 18:26:05,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-02-02 18:26:05,275 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-02 18:26:05,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:05,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-02 18:26:05,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 18:26:05,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 18:26:05,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:26:05,292 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 27 states. [2018-02-02 18:26:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:07,314 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-02-02 18:26:07,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:26:07,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-02-02 18:26:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:07,315 INFO L225 Difference]: With dead ends: 93 [2018-02-02 18:26:07,315 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 18:26:07,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=297, Invalid=1865, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 18:26:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 18:26:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2018-02-02 18:26:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 18:26:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 18:26:07,318 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-02-02 18:26:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:07,319 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 18:26:07,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 18:26:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 18:26:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 18:26:07,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:07,320 INFO L351 BasicCegarLoop]: trace histogram [3, 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-02 18:26:07,320 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1916750925, now seen corresponding path program 2 times [2018-02-02 18:26:07,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:07,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:07,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:07,321 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:26:07,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:07,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:07,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:07,575 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-02 18:26:07,580 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:26:07,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:26:07,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:26:07,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:07,601 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-02 18:26:07,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:26:07,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 18:26:07,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:07,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:07,644 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-02 18:26:07,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,652 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-02 18:26:07,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 18:26:07,690 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-02 18:26:07,691 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-02 18:26:07,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,697 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-02 18:26:07,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 18:26:07,720 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-02 18:26:07,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 18:26:07,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 18:26:07,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-02 18:26:07,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-02 18:26:07,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-02 18:26:07,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:07,980 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-02 18:26:07,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:07,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:07,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:07,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-02 18:26:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:08,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:08,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-02-02 18:26:08,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 18:26:08,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 18:26:08,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-02-02 18:26:08,126 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 31 states. [2018-02-02 18:26:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:11,319 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-02-02 18:26:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:26:11,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2018-02-02 18:26:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:11,319 INFO L225 Difference]: With dead ends: 74 [2018-02-02 18:26:11,319 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 18:26:11,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 18:26:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 18:26:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 18:26:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 18:26:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 18:26:11,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-02-02 18:26:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:11,320 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 18:26:11,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 18:26:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 18:26:11,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 18:26:11,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:26:11 BoogieIcfgContainer [2018-02-02 18:26:11,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:26:11,324 INFO L168 Benchmark]: Toolchain (without parser) took 12491.58 ms. Allocated memory was 397.9 MB in the beginning and 737.1 MB in the end (delta: 339.2 MB). Free memory was 353.3 MB in the beginning and 624.9 MB in the end (delta: -271.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:11,324 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:26:11,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 397.9 MB. Free memory was 352.0 MB in the beginning and 341.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:11,325 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 ms. Allocated memory is still 397.9 MB. Free memory was 341.3 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:11,325 INFO L168 Benchmark]: RCFGBuilder took 170.61 ms. Allocated memory is still 397.9 MB. Free memory was 340.0 MB in the beginning and 321.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:11,325 INFO L168 Benchmark]: TraceAbstraction took 12137.39 ms. Allocated memory was 397.9 MB in the beginning and 737.1 MB in the end (delta: 339.2 MB). Free memory was 320.2 MB in the beginning and 624.9 MB in the end (delta: -304.8 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:11,326 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 397.9 MB. Free memory was 352.0 MB in the beginning and 341.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.23 ms. Allocated memory is still 397.9 MB. Free memory was 341.3 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 170.61 ms. Allocated memory is still 397.9 MB. Free memory was 340.0 MB in the beginning and 321.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12137.39 ms. Allocated memory was 397.9 MB in the beginning and 737.1 MB in the end (delta: 339.2 MB). Free memory was 320.2 MB in the beginning and 624.9 MB in the end (delta: -304.8 MB). Peak memory consumption was 34.5 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: 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: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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, 12.1s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 417 SDtfs, 831 SDslu, 2222 SDs, 0 SdLazy, 2307 SolverSat, 189 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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, 63 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 425 ConstructedInterpolants, 42 QuantifiedInterpolants, 142296 SizeOfPredicates, 56 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 7/60 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_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-26-11-332.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-26-11-332.csv Received shutdown request...