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_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:10:09,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:10:09,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:10:09,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:10:09,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:10:09,344 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:10:09,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:10:09,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:10:09,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:10:09,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:10:09,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:10:09,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:10:09,349 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:10:09,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:10:09,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:10:09,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:10:09,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:10:09,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:10:09,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:10:09,357 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:10:09,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:10:09,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:10:09,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:10:09,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:10:09,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:10:09,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:10:09,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:10:09,362 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:10:09,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:10:09,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:10:09,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:10:09,363 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-04 12:10:09,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:10:09,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:10:09,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:10:09,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:10:09,374 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:10:09,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:10:09,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:10:09,374 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:10:09,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:10:09,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:10:09,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:10:09,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:10:09,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:10:09,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:10:09,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:10:09,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:10:09,376 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:10:09,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:10:09,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:10:09,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:10:09,415 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:10:09,418 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:10:09,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:10:09,420 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:10:09,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:09,566 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:10:09,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:10:09,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:09,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:10:09,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:10:09,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09, skipping insertion in model container [2018-02-04 12:10:09,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,591 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:09,621 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:09,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:09,724 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:09,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09 WrapperNode [2018-02-04 12:10:09,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:09,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:10:09,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:10:09,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:10:09,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (1/1) ... [2018-02-04 12:10:09,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:10:09,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:10:09,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:10:09,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:10:09,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (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-04 12:10:09,788 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:10:09,788 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:10:09,788 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 12:10:09,788 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:10:09,788 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:10:09,788 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:10:09,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:10:09,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:10:09,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:10:09,930 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:10:09,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:09 BoogieIcfgContainer [2018-02-04 12:10:09,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:10:09,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:10:09,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:10:09,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:10:09,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:10:09" (1/3) ... [2018-02-04 12:10:09,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480b1e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:09, skipping insertion in model container [2018-02-04 12:10:09,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:09" (2/3) ... [2018-02-04 12:10:09,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480b1e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:09, skipping insertion in model container [2018-02-04 12:10:09,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:09" (3/3) ... [2018-02-04 12:10:09,935 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:09,940 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:10:09,945 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 12:10:09,973 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:10:09,974 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:10:09,974 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:10:09,974 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:10:09,974 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:10:09,974 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:10:09,974 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:10:09,974 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:10:09,975 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:10:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-02-04 12:10:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:09,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:09,990 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:09,990 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:09,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501255, now seen corresponding path program 1 times [2018-02-04 12:10:09,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:09,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,141 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-04 12:10:10,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:10,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:10,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:10,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:10,154 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-02-04 12:10:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,290 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-04 12:10:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:10,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:10:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,299 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:10:10,299 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 12:10:10,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 12:10:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 12:10:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 12:10:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 12:10:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 12:10:10,326 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-02-04 12:10:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,326 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 12:10:10,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 12:10:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:10,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:10,327 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501254, now seen corresponding path program 1 times [2018-02-04 12:10:10,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,400 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-04 12:10:10,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:10,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:10,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:10,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:10,401 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-02-04 12:10:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,456 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 12:10:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:10,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:10:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,458 INFO L225 Difference]: With dead ends: 42 [2018-02-04 12:10:10,458 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 12:10:10,459 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-04 12:10:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 12:10:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 12:10:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 12:10:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 12:10:10,463 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-04 12:10:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,463 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 12:10:10,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 12:10:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:10,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:10,464 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -76898612, now seen corresponding path program 1 times [2018-02-04 12:10:10,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,507 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-04 12:10:10,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:10,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:10,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:10,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:10,509 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-02-04 12:10:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,557 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 12:10:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:10,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:10:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,559 INFO L225 Difference]: With dead ends: 41 [2018-02-04 12:10:10,559 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 12:10:10,559 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-04 12:10:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 12:10:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 12:10:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 12:10:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 12:10:10,562 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 12:10:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,562 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 12:10:10,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 12:10:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:10,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,563 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:10,563 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -76898611, now seen corresponding path program 1 times [2018-02-04 12:10:10,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,564 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,625 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-04 12:10:10,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:10,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:10,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:10,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:10,625 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-04 12:10:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,645 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-04 12:10:10,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:10,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:10:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,646 INFO L225 Difference]: With dead ends: 40 [2018-02-04 12:10:10,646 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 12:10:10,646 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-04 12:10:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 12:10:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 12:10:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 12:10:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-04 12:10:10,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-02-04 12:10:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,650 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-04 12:10:10,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-04 12:10:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:10:10,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,651 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-04 12:10:10,651 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085779, now seen corresponding path program 1 times [2018-02-04 12:10:10,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,691 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-04 12:10:10,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:10,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:10,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:10,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:10,692 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-02-04 12:10:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,743 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-02-04 12:10:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:10,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 12:10:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,744 INFO L225 Difference]: With dead ends: 39 [2018-02-04 12:10:10,744 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 12:10:10,744 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-04 12:10:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 12:10:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 12:10:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 12:10:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-04 12:10:10,747 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2018-02-04 12:10:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,747 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-04 12:10:10,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-04 12:10:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:10:10,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,748 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-04 12:10:10,748 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085778, now seen corresponding path program 1 times [2018-02-04 12:10:10,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,830 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-04 12:10:10,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:10:10,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:10:10,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:10:10,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:10:10,830 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-02-04 12:10:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:10,911 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-02-04 12:10:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:10:10,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 12:10:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:10,912 INFO L225 Difference]: With dead ends: 44 [2018-02-04 12:10:10,912 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 12:10:10,913 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-04 12:10:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 12:10:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-02-04 12:10:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 12:10:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 12:10:10,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-02-04 12:10:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:10,916 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 12:10:10,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:10:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 12:10:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:10,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:10,917 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] [2018-02-04 12:10:10,917 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash -551391085, now seen corresponding path program 1 times [2018-02-04 12:10:10,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:10,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:10,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,918 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:10,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:10,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:10,955 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-04 12:10:10,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:10,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:10:10,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:10:10,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:10:10,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:10:10,956 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-04 12:10:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:11,035 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 12:10:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:10:11,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 12:10:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:11,037 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:10:11,037 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:10:11,037 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-04 12:10:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:10:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-02-04 12:10:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 12:10:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 12:10:11,039 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2018-02-04 12:10:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:11,040 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 12:10:11,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:10:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 12:10:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:11,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:11,040 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] [2018-02-04 12:10:11,040 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -551391084, now seen corresponding path program 1 times [2018-02-04 12:10:11,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:11,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:11,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:11,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:11,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:11,119 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-04 12:10:11,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:11,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:10:11,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:10:11,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:10:11,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:11,120 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 12:10:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:11,204 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-04 12:10:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:10:11,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 12:10:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:11,205 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:10:11,205 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:10:11,205 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-04 12:10:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:10:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-02-04 12:10:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 12:10:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 12:10:11,207 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-02-04 12:10:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:11,207 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 12:10:11,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:10:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 12:10:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:11,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:11,207 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-04 12:10:11,207 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1601452084, now seen corresponding path program 1 times [2018-02-04 12:10:11,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:11,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:11,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:11,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:11,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:11,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:11,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:10:11,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:10:11,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:10:11,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:10:11,367 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-02-04 12:10:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:11,612 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 12:10:11,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:10:11,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 12:10:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:11,613 INFO L225 Difference]: With dead ends: 69 [2018-02-04 12:10:11,613 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 12:10:11,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:10:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 12:10:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-02-04 12:10:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:10:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 12:10:11,615 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-02-04 12:10:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:11,615 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 12:10:11,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:10:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 12:10:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:11,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:11,616 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-04 12:10:11,616 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1820306802, now seen corresponding path program 1 times [2018-02-04 12:10:11,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:11,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:11,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:11,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:11,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:11,848 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-04 12:10:11,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:11,848 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-04 12:10:11,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:11,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:11,918 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-04 12:10:11,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:11,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:11,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:11,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:11,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:11,957 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-04 12:10:11,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:11,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:11,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:10:11,993 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-04 12:10:11,995 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-04 12:10:11,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:11,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:12,002 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-04 12:10:12,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:10:12,053 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-04 12:10:12,055 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-04 12:10:12,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:12,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:12,065 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-04 12:10:12,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:10:12,231 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-04 12:10:12,233 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-04 12:10:12,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:12,242 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-04 12:10:12,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:12,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:12,253 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-04 12:10:12,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-04 12:10:12,305 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-04 12:10:12,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:12,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-02-04 12:10:12,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:10:12,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:10:12,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:10:12,325 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 26 states. [2018-02-04 12:10:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:13,862 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 12:10:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:10:13,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-02-04 12:10:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:13,863 INFO L225 Difference]: With dead ends: 82 [2018-02-04 12:10:13,863 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 12:10:13,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=1494, Unknown=1, NotChecked=0, Total=1722 [2018-02-04 12:10:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 12:10:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-02-04 12:10:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:10:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 12:10:13,867 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-02-04 12:10:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:13,867 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 12:10:13,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:10:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 12:10:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:13,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:13,868 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:13,868 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1820393708, now seen corresponding path program 1 times [2018-02-04 12:10:13,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:13,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:13,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:13,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:13,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:13,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:13,978 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-04 12:10:13,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:13,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:10:13,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:10:13,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:10:13,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:10:13,979 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-02-04 12:10:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:14,181 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-02-04 12:10:14,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:10:14,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 12:10:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:14,182 INFO L225 Difference]: With dead ends: 135 [2018-02-04 12:10:14,182 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 12:10:14,182 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-04 12:10:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 12:10:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-02-04 12:10:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 12:10:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-02-04 12:10:14,188 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 28 [2018-02-04 12:10:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:14,189 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-02-04 12:10:14,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:10:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-02-04 12:10:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:14,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:14,190 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:14,190 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2051871762, now seen corresponding path program 1 times [2018-02-04 12:10:14,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:14,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:14,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:14,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:14,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:14,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:14,378 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-04 12:10:14,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:14,379 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-04 12:10:14,386 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:14,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:14,406 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-04 12:10:14,407 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-04 12:10:14,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:14,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:14,412 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-04 12:10:14,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:10:14,524 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-04 12:10:14,535 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-04 12:10:14,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:14,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:14,546 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-04 12:10:14,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:10:14,601 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-04 12:10:14,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:14,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-02-04 12:10:14,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:10:14,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:10:14,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:10:14,619 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 21 states. [2018-02-04 12:10:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:15,401 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-02-04 12:10:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:10:15,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-04 12:10:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:15,402 INFO L225 Difference]: With dead ends: 135 [2018-02-04 12:10:15,402 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 12:10:15,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:10:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 12:10:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2018-02-04 12:10:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 12:10:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-02-04 12:10:15,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-02-04 12:10:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:15,408 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-02-04 12:10:15,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:10:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-02-04 12:10:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:10:15,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:15,409 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] [2018-02-04 12:10:15,410 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:15,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1662272263, now seen corresponding path program 1 times [2018-02-04 12:10:15,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:15,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:15,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:15,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:15,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:15,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:15,500 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-04 12:10:15,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:15,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:15,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:15,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:15,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:15,501 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 6 states. [2018-02-04 12:10:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:15,582 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-04 12:10:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:10:15,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 12:10:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:15,583 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:10:15,583 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 12:10:15,584 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-04 12:10:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 12:10:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 12:10:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 12:10:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-02-04 12:10:15,587 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 30 [2018-02-04 12:10:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:15,587 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-02-04 12:10:15,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-02-04 12:10:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:10:15,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:15,588 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, 1] [2018-02-04 12:10:15,588 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -795993964, now seen corresponding path program 2 times [2018-02-04 12:10:15,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:15,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:15,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:15,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:15,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:15,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:15,819 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-04 12:10:15,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:15,819 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-04 12:10:15,824 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:15,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:15,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:15,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:15,847 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-04 12:10:15,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:15,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:15,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:15,889 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 16 treesize of output 13 [2018-02-04 12:10:15,890 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-04 12:10:15,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:15,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:15,895 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-04 12:10:15,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-02-04 12:10:16,064 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 22 treesize of output 18 [2018-02-04 12:10:16,069 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-04 12:10:16,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:16,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:16,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 12:10:16,135 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-04 12:10:16,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:16,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-04 12:10:16,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:10:16,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:10:16,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:10:16,153 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 26 states. [2018-02-04 12:10:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:17,079 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-04 12:10:17,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:10:17,080 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-04 12:10:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:17,080 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:10:17,080 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:10:17,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:10:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:10:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2018-02-04 12:10:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:10:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-04 12:10:17,082 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2018-02-04 12:10:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:17,083 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-04 12:10:17,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:10:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-04 12:10:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:10:17,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:17,084 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-04 12:10:17,084 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:10:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 184039152, now seen corresponding path program 2 times [2018-02-04 12:10:17,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:17,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:17,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:17,085 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:17,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:17,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:17,370 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-04 12:10:17,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:17,370 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-04 12:10:17,375 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:17,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:17,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:17,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:17,392 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-04 12:10:17,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,416 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-04 12:10:17,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:10:17,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:17,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:17,456 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-04 12:10:17,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,461 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-04 12:10:17,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:10:17,506 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-04 12:10:17,508 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-04 12:10:17,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,515 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-04 12:10:17,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:10:17,543 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-04 12:10:17,545 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-04 12:10:17,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,554 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-04 12:10:17,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:10:17,806 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-04 12:10:17,808 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-04 12:10:17,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:17,815 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-04 12:10:17,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:17,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:17,824 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-04 12:10:17,824 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-04 12:10:17,887 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-04 12:10:17,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:17,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-04 12:10:17,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:10:17,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:10:17,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:10:17,905 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 29 states. [2018-02-04 12:10:23,026 WARN L146 SmtUtils]: Spent 2622ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-02-04 12:10:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:23,076 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-02-04 12:10:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:10:23,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-02-04 12:10:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:23,077 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:10:23,077 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:10:23,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 12:10:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:10:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:10:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:10:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:10:23,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-02-04 12:10:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:23,078 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:10:23,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:10:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:10:23,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:10:23,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:10:23 BoogieIcfgContainer [2018-02-04 12:10:23,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:10:23,082 INFO L168 Benchmark]: Toolchain (without parser) took 13515.66 ms. Allocated memory was 399.0 MB in the beginning and 739.2 MB in the end (delta: 340.3 MB). Free memory was 357.2 MB in the beginning and 488.8 MB in the end (delta: -131.6 MB). Peak memory consumption was 208.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:23,083 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:23,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.50 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:23,083 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:23,084 INFO L168 Benchmark]: RCFGBuilder took 175.56 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 325.8 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:23,084 INFO L168 Benchmark]: TraceAbstraction took 13150.73 ms. Allocated memory was 399.0 MB in the beginning and 739.2 MB in the end (delta: 340.3 MB). Free memory was 324.4 MB in the beginning and 488.8 MB in the end (delta: -164.3 MB). Peak memory consumption was 175.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:23,085 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.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.50 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.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.06 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.56 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 325.8 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13150.73 ms. Allocated memory was 399.0 MB in the beginning and 739.2 MB in the end (delta: 340.3 MB). Free memory was 324.4 MB in the beginning and 488.8 MB in the end (delta: -164.3 MB). Peak memory consumption was 175.9 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: 552]: 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, 47 locations, 9 error locations. SAFE Result, 13.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 508 SDtfs, 963 SDslu, 2787 SDs, 0 SdLazy, 2344 SolverSat, 238 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, 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, 15 MinimizatonAttempts, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 457 ConstructedInterpolants, 44 QuantifiedInterpolants, 140919 SizeOfPredicates, 52 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10/63 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_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-10-23-091.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-10-23-091.csv Received shutdown request...