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/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:18:57,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:18:57,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:18:57,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:18:57,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:18:57,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:18:57,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:18:57,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:18:57,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:18:57,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:18:57,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:18:57,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:18:57,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:18:57,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:18:57,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:18:57,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:18:57,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:18:57,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:18:57,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:18:57,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:18:57,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:18:57,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:18:57,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:18:57,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:18:57,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:18:57,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:18:57,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:18:57,906 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:18:57,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:18:57,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:18:57,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:18:57,907 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:18:57,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:18:57,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:18:57,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:18:57,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:18:57,916 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:18:57,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:18:57,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:18:57,916 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:18:57,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:18:57,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:18:57,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:18:57,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:18:57,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:18:57,960 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:18:57,963 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:18:57,964 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:18:57,964 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:18:57,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-02 19:18:58,159 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:18:58,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:18:58,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:18:58,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:18:58,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:18:58,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585b8cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58, skipping insertion in model container [2018-02-02 19:18:58,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,182 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:18:58,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:18:58,299 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:18:58,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:18:58,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58 WrapperNode [2018-02-02 19:18:58,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:18:58,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:18:58,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:18:58,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:18:58,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... [2018-02-02 19:18:58,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:18:58,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:18:58,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:18:58,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:18:58,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:18:58,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:18:58,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:18:58,377 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:18:58,377 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:18:58,377 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:18:58,377 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:18:58,377 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:18:58,378 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:18:58,482 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:18:58,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:18:58 BoogieIcfgContainer [2018-02-02 19:18:58,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:18:58,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:18:58,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:18:58,485 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:18:58,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:18:58" (1/3) ... [2018-02-02 19:18:58,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6714ceaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:18:58, skipping insertion in model container [2018-02-02 19:18:58,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:18:58" (2/3) ... [2018-02-02 19:18:58,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6714ceaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:18:58, skipping insertion in model container [2018-02-02 19:18:58,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:18:58" (3/3) ... [2018-02-02 19:18:58,487 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-02 19:18:58,492 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:18:58,497 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 19:18:58,524 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:18:58,524 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:18:58,524 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:18:58,525 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:18:58,525 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:18:58,525 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:18:58,525 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:18:58,525 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:18:58,525 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:18:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-02 19:18:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:18:58,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:58,541 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:18:58,541 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-02-02 19:18:58,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:58,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:58,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:58,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:58,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:58,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:58,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:18:58,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:18:58,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:18:58,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:18:58,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:18:58,691 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-02-02 19:18:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:18:58,811 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-02 19:18:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:18:58,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 19:18:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:18:58,821 INFO L225 Difference]: With dead ends: 46 [2018-02-02 19:18:58,821 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 19:18:58,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:18:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 19:18:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-02 19:18:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 19:18:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-02-02 19:18:58,849 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-02-02 19:18:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:18:58,850 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-02-02 19:18:58,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:18:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-02-02 19:18:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:18:58,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:58,851 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:18:58,851 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-02-02 19:18:58,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:58,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:58,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:58,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:58,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:58,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:58,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:18:58,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:18:58,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:18:58,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:18:58,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:18:58,915 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-02-02 19:18:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:18:58,982 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-02-02 19:18:58,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:18:58,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:18:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:18:58,987 INFO L225 Difference]: With dead ends: 48 [2018-02-02 19:18:58,987 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 19:18:58,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:18:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 19:18:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-02-02 19:18:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 19:18:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-02-02 19:18:58,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-02-02 19:18:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:18:58,994 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-02-02 19:18:58,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:18:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-02-02 19:18:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 19:18:59,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:59,001 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:18:59,001 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-02-02 19:18:59,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:59,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:59,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:18:59,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:18:59,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:18:59,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:18:59,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:18:59,077 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-02-02 19:18:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:18:59,101 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-02-02 19:18:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:18:59,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 19:18:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:18:59,102 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:18:59,102 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:18:59,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:18:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:18:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-02-02 19:18:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 19:18:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-02-02 19:18:59,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-02-02 19:18:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:18:59,106 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-02-02 19:18:59,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:18:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-02-02 19:18:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:18:59,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:59,106 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:18:59,106 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-02-02 19:18:59,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:59,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:59,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:18:59,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:18:59,155 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:18:59,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:18:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:18:59,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-02 19:18:59,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:18:59,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:18:59,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:18:59,221 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-02-02 19:18:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:18:59,232 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-02 19:18:59,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:18:59,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 19:18:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:18:59,234 INFO L225 Difference]: With dead ends: 34 [2018-02-02 19:18:59,234 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 19:18:59,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:18:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 19:18:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 19:18:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 19:18:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-02 19:18:59,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-02-02 19:18:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:18:59,239 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-02 19:18:59,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:18:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-02 19:18:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 19:18:59,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:59,240 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] [2018-02-02 19:18:59,240 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-02-02 19:18:59,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:59,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:59,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:18:59,302 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:18:59,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:18:59,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:18:59,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:18:59,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:18:59,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:18:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:18:59,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 19:18:59,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:18:59,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:18:59,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:18:59,397 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-02 19:18:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:18:59,458 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-02 19:18:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:18:59,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 19:18:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:18:59,460 INFO L225 Difference]: With dead ends: 35 [2018-02-02 19:18:59,460 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 19:18:59,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:18:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 19:18:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-02 19:18:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 19:18:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-02 19:18:59,463 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-02-02 19:18:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:18:59,464 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-02 19:18:59,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:18:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-02 19:18:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 19:18:59,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:18:59,465 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] [2018-02-02 19:18:59,465 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:18:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-02-02 19:18:59,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:18:59,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:18:59,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:18:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:18:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:18:59,675 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:18:59,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:18:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:18:59,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:18:59,716 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 20 treesize of output 19 [2018-02-02 19:18:59,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:18:59,729 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 17 treesize of output 16 [2018-02-02 19:18:59,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:18:59,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:18:59,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:18:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:18:59,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:18:59,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-02-02 19:18:59,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:18:59,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:18:59,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:18:59,934 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2018-02-02 19:19:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:00,181 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-02-02 19:19:00,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:19:00,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-02 19:19:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:00,182 INFO L225 Difference]: With dead ends: 38 [2018-02-02 19:19:00,182 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 19:19:00,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:19:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 19:19:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 19:19:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 19:19:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-02 19:19:00,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-02-02 19:19:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:00,184 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-02 19:19:00,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:19:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-02 19:19:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:19:00,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:00,185 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:00,185 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-02-02 19:19:00,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:00,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:00,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:00,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:00,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:00,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:00,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:00,276 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:00,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:00,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:00,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:19:00,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:19:00,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:00,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:00,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-02 19:19:00,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:19:00,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 19:19:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:00,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:00,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-02 19:19:00,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:19:00,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:19:00,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:19:00,345 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 11 states. [2018-02-02 19:19:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:00,444 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-02 19:19:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:19:00,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-02 19:19:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:00,445 INFO L225 Difference]: With dead ends: 47 [2018-02-02 19:19:00,445 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 19:19:00,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:19:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 19:19:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-02-02 19:19:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 19:19:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-02 19:19:00,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-02 19:19:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:00,448 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-02 19:19:00,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:19:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-02 19:19:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:19:00,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:00,448 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:00,448 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-02-02 19:19:00,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:00,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:00,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:00,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:00,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:00,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:00,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:00,666 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:00,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:00,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:00,714 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 23 treesize of output 22 [2018-02-02 19:19:00,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,735 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 22 treesize of output 21 [2018-02-02 19:19:00,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,738 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 26 treesize of output 25 [2018-02-02 19:19:00,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,758 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 25 treesize of output 24 [2018-02-02 19:19:00,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:19:00,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:19:00,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:00,957 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 52 treesize of output 55 [2018-02-02 19:19:00,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:00,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:00,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:00,999 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 44 treesize of output 38 [2018-02-02 19:19:00,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:01,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:01,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:01,037 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 47 treesize of output 41 [2018-02-02 19:19:01,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:01,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-02 19:19:01,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:01,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 19:19:01,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-02 19:19:01,323 WARN L143 SmtUtils]: Spent 201ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-02 19:19:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:01,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:01,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-02 19:19:01,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:19:01,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:19:01,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-02-02 19:19:01,346 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 19 states. [2018-02-02 19:19:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:22,168 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-02 19:19:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:19:22,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2018-02-02 19:19:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:22,169 INFO L225 Difference]: With dead ends: 49 [2018-02-02 19:19:22,169 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:19:22,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=113, Invalid=639, Unknown=4, NotChecked=0, Total=756 [2018-02-02 19:19:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:19:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-02-02 19:19:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 19:19:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-02 19:19:22,173 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-02 19:19:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:22,173 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-02 19:19:22,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:19:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-02 19:19:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:19:22,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:22,174 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:22,174 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-02-02 19:19:22,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:22,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:22,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:22,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:22,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:19:22,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:22,208 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:22,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:22,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:19:22,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:22,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-02 19:19:22,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:19:22,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:19:22,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:19:22,280 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-02-02 19:19:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:22,312 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-02 19:19:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:19:22,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 19:19:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:22,313 INFO L225 Difference]: With dead ends: 42 [2018-02-02 19:19:22,313 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 19:19:22,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:19:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 19:19:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-02 19:19:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 19:19:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-02 19:19:22,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-02-02 19:19:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:22,333 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-02 19:19:22,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:19:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-02 19:19:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:19:22,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:22,334 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:22,334 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-02-02 19:19:22,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:22,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:22,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:22,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:22,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:19:22,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:22,494 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:22,501 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:22,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:22,548 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 17 treesize of output 16 [2018-02-02 19:19:22,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:22,558 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 20 treesize of output 19 [2018-02-02 19:19:22,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:22,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:19:22,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:19:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:19:22,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:22,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-02 19:19:22,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:19:22,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:19:22,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:19:22,688 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-02-02 19:19:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:22,980 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-02-02 19:19:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:19:22,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-02-02 19:19:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:22,981 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:19:22,981 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:19:22,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:19:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:19:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-02-02 19:19:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:19:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-02 19:19:22,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-02-02 19:19:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:22,986 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-02 19:19:22,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:19:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-02 19:19:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:19:22,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:22,987 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:22,987 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-02-02 19:19:22,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:22,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:22,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:22,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:22,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:23,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:23,267 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:23,272 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:19:23,289 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:19:23,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:23,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:23,310 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 26 treesize of output 25 [2018-02-02 19:19:23,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,324 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 23 treesize of output 22 [2018-02-02 19:19:23,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,338 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 25 treesize of output 24 [2018-02-02 19:19:23,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,341 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 22 treesize of output 21 [2018-02-02 19:19:23,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:19:23,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:19:23,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,568 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 54 treesize of output 48 [2018-02-02 19:19:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,599 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 45 treesize of output 48 [2018-02-02 19:19:23,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-02 19:19:23,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:19:23,786 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 44 treesize of output 38 [2018-02-02 19:19:23,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:23,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 19:19:23,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-02 19:19:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:19:24,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:24,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-02-02 19:19:24,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:19:24,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:19:24,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=490, Unknown=4, NotChecked=0, Total=552 [2018-02-02 19:19:24,136 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 24 states. [2018-02-02 19:19:47,540 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-02-02 19:19:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:47,561 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-02 19:19:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:19:47,561 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-02 19:19:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:47,561 INFO L225 Difference]: With dead ends: 63 [2018-02-02 19:19:47,562 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 19:19:47,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=193, Invalid=1282, Unknown=7, NotChecked=0, Total=1482 [2018-02-02 19:19:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 19:19:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-02-02 19:19:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 19:19:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-02-02 19:19:47,565 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-02-02 19:19:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:47,565 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-02-02 19:19:47,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:19:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-02-02 19:19:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:19:47,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:47,566 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1] [2018-02-02 19:19:47,566 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-02-02 19:19:47,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:47,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:47,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,567 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:47,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:47,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 19:19:47,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:47,604 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:47,612 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:19:47,626 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:19:47,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:47,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 19:19:47,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:47,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-02 19:19:47,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:19:47,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:19:47,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:19:47,669 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-02-02 19:19:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:47,699 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-02 19:19:47,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:19:47,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 19:19:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:47,700 INFO L225 Difference]: With dead ends: 46 [2018-02-02 19:19:47,700 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 19:19:47,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:19:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 19:19:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-02 19:19:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 19:19:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-02 19:19:47,702 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-02-02 19:19:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:47,702 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-02 19:19:47,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:19:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-02 19:19:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:19:47,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:47,703 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:47,703 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-02-02 19:19:47,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:47,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:47,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,704 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:47,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:47,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 19:19:47,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:47,752 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:47,760 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:19:47,789 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 19:19:47,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:47,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 19:19:47,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:47,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-02 19:19:47,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:19:47,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:19:47,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:19:47,846 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2018-02-02 19:19:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:47,877 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 19:19:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:19:47,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-02 19:19:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:47,878 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:19:47,878 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:19:47,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:19:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:19:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-02 19:19:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:19:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-02-02 19:19:47,880 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 51 [2018-02-02 19:19:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:47,881 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-02-02 19:19:47,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:19:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-02-02 19:19:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 19:19:47,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:47,882 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:47,882 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1516212575, now seen corresponding path program 4 times [2018-02-02 19:19:47,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:47,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:47,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,883 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:47,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:47,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 19:19:47,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:47,937 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:47,945 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 19:19:47,969 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 19:19:47,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:47,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 19:19:48,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:48,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 19:19:48,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:19:48,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:19:48,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:19:48,037 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 13 states. [2018-02-02 19:19:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:48,089 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-02-02 19:19:48,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:19:48,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-02 19:19:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:48,090 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:19:48,090 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:19:48,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:19:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:19:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-02-02 19:19:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 19:19:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-02 19:19:48,092 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2018-02-02 19:19:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:48,093 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-02 19:19:48,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:19:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-02 19:19:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 19:19:48,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:48,093 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:48,093 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -342764997, now seen corresponding path program 5 times [2018-02-02 19:19:48,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:48,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:48,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,095 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:48,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:48,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 19:19:48,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:48,176 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:48,180 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 19:19:48,208 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 19:19:48,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:48,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 19:19:48,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:48,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 19:19:48,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:19:48,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:19:48,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:19:48,288 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 15 states. [2018-02-02 19:19:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:48,358 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-02-02 19:19:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:19:48,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-02-02 19:19:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:48,359 INFO L225 Difference]: With dead ends: 64 [2018-02-02 19:19:48,359 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 19:19:48,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:19:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 19:19:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 19:19:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:19:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-02 19:19:48,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 71 [2018-02-02 19:19:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:48,363 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-02 19:19:48,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:19:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-02 19:19:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:19:48,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:48,364 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:48,364 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1199419415, now seen corresponding path program 6 times [2018-02-02 19:19:48,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:48,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:48,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,365 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:48,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:48,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-02 19:19:48,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:48,444 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:48,448 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 19:19:48,490 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 19:19:48,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:48,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-02 19:19:48,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:48,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 19:19:48,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:19:48,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:19:48,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:19:48,559 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 17 states. [2018-02-02 19:19:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:48,609 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-02-02 19:19:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:19:48,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-02-02 19:19:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:48,609 INFO L225 Difference]: With dead ends: 70 [2018-02-02 19:19:48,609 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 19:19:48,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:19:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 19:19:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-02 19:19:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 19:19:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-02-02 19:19:48,613 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 81 [2018-02-02 19:19:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:48,613 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-02-02 19:19:48,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:19:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-02-02 19:19:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 19:19:48,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:48,614 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:48,614 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1552083699, now seen corresponding path program 7 times [2018-02-02 19:19:48,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:48,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:48,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,615 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:48,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:48,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 19:19:48,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:48,707 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:48,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:48,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 19:19:48,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:48,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 19:19:48,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:19:48,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:19:48,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:19:48,829 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 19 states. [2018-02-02 19:19:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:48,876 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-02-02 19:19:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:19:48,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-02-02 19:19:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:48,877 INFO L225 Difference]: With dead ends: 76 [2018-02-02 19:19:48,877 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 19:19:48,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:19:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 19:19:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-02-02 19:19:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 19:19:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-02-02 19:19:48,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 91 [2018-02-02 19:19:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:48,880 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-02-02 19:19:48,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:19:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-02-02 19:19:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 19:19:48,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:48,880 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:48,880 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1951482575, now seen corresponding path program 8 times [2018-02-02 19:19:48,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:48,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:48,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:48,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:48,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-02 19:19:48,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:48,965 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:48,973 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:19:49,013 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:19:49,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:49,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-02 19:19:49,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:49,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 19:19:49,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:19:49,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:19:49,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:19:49,135 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 21 states. [2018-02-02 19:19:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:49,234 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-02-02 19:19:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:19:49,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-02-02 19:19:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:49,235 INFO L225 Difference]: With dead ends: 82 [2018-02-02 19:19:49,235 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 19:19:49,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:19:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 19:19:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-02 19:19:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 19:19:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2018-02-02 19:19:49,239 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 101 [2018-02-02 19:19:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:49,239 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2018-02-02 19:19:49,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:19:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-02-02 19:19:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 19:19:49,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:49,240 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:49,240 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1340635051, now seen corresponding path program 9 times [2018-02-02 19:19:49,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:49,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:49,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:49,242 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:49,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:49,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 19:19:49,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:49,417 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:19:49,429 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:19:49,500 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 19:19:49,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:49,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 19:19:49,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:49,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-02 19:19:49,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:19:49,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:19:49,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:19:49,584 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 23 states. [2018-02-02 19:19:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:49,680 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-02-02 19:19:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:19:49,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2018-02-02 19:19:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:49,681 INFO L225 Difference]: With dead ends: 88 [2018-02-02 19:19:49,681 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 19:19:49,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:19:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 19:19:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-02-02 19:19:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:19:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-02-02 19:19:49,684 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 111 [2018-02-02 19:19:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:49,684 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-02-02 19:19:49,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:19:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-02-02 19:19:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 19:19:49,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:49,685 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:19:49,685 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 19:19:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1134053767, now seen corresponding path program 10 times [2018-02-02 19:19:49,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:49,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:49,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:49,686 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:19:49,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:19:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:19:49,730 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 19:19:49,749 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 19:19:49,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:19:49 BoogieIcfgContainer [2018-02-02 19:19:49,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:19:49,769 INFO L168 Benchmark]: Toolchain (without parser) took 51608.79 ms. Allocated memory was 404.8 MB in the beginning and 735.1 MB in the end (delta: 330.3 MB). Free memory was 361.4 MB in the beginning and 597.8 MB in the end (delta: -236.4 MB). Peak memory consumption was 93.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:19:49,769 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:19:49,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.46 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:19:49,770 INFO L168 Benchmark]: Boogie Preprocessor took 26.63 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:19:49,770 INFO L168 Benchmark]: RCFGBuilder took 140.97 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 331.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:19:49,770 INFO L168 Benchmark]: TraceAbstraction took 51285.32 ms. Allocated memory was 404.8 MB in the beginning and 735.1 MB in the end (delta: 330.3 MB). Free memory was 331.0 MB in the beginning and 597.8 MB in the end (delta: -266.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:19:49,771 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.11 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.46 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.63 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 140.97 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 331.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51285.32 ms. Allocated memory was 404.8 MB in the beginning and 735.1 MB in the end (delta: 330.3 MB). Free memory was 331.0 MB in the beginning and 597.8 MB in the end (delta: -266.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1453] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={42:0}, i=0, len=10] [L1443] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1444] COND TRUE i