./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb8eeb6e67f290f9d56e698aa8c9c7a779115813 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:40:57,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:40:57,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:40:57,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:40:57,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:40:57,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:40:57,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:40:57,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:40:57,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:40:57,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:40:57,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:40:57,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:40:57,046 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:40:57,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:40:57,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:40:57,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:40:57,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:40:57,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:40:57,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:40:57,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:40:57,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:40:57,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:40:57,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:40:57,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:40:57,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:40:57,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:40:57,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:40:57,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:40:57,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:40:57,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:40:57,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:40:57,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:40:57,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:40:57,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:40:57,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:40:57,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:40:57,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:40:57,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:40:57,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:40:57,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:40:57,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:40:57,117 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:40:57,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:40:57,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:40:57,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:40:57,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:40:57,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:40:57,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:40:57,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:40:57,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:40:57,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:40:57,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:40:57,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:40:57,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:40:57,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:40:57,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:40:57,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:40:57,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:40:57,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:40:57,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:40:57,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:40:57,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:40:57,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:40:57,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:40:57,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:40:57,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb8eeb6e67f290f9d56e698aa8c9c7a779115813 [2018-12-30 19:40:57,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:40:57,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:40:57,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:40:57,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:40:57,187 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:40:57,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-12-30 19:40:57,250 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6daf12c/3956f4deb9074fffbe74b18a36c62332/FLAG5a0fec007 [2018-12-30 19:40:57,835 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:40:57,836 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-12-30 19:40:57,856 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6daf12c/3956f4deb9074fffbe74b18a36c62332/FLAG5a0fec007 [2018-12-30 19:40:58,071 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6daf12c/3956f4deb9074fffbe74b18a36c62332 [2018-12-30 19:40:58,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:40:58,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:40:58,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:58,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:40:58,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:40:58,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:58,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58, skipping insertion in model container [2018-12-30 19:40:58,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:58,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:40:58,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:40:58,688 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:58,701 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:40:58,836 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:58,856 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:40:58,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58 WrapperNode [2018-12-30 19:40:58,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:58,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:58,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:40:58,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:40:58,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:58,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:59,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:40:59,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:40:59,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:40:59,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... [2018-12-30 19:40:59,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:40:59,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:40:59,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:40:59,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:40:59,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (1/1) ... No working directory specified, using /storage/repos/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-12-30 19:40:59,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:40:59,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:41:02,649 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:41:02,649 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:41:02,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:02 BoogieIcfgContainer [2018-12-30 19:41:02,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:41:02,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:41:02,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:41:02,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:41:02,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:40:58" (1/3) ... [2018-12-30 19:41:02,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:02, skipping insertion in model container [2018-12-30 19:41:02,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:58" (2/3) ... [2018-12-30 19:41:02,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:02, skipping insertion in model container [2018-12-30 19:41:02,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:02" (3/3) ... [2018-12-30 19:41:02,659 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label18_true-unreach-call_false-termination.c [2018-12-30 19:41:02,670 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:41:02,679 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:41:02,697 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:41:02,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:41:02,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:41:02,742 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:41:02,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:41:02,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:41:02,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:41:02,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:41:02,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:41:02,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:41:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:41:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 19:41:02,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:02,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:02,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1128398527, now seen corresponding path program 1 times [2018-12-30 19:41:02,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:02,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:02,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:02,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:02,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:03,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:03,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:03,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:03,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:03,489 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:41:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:05,881 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2018-12-30 19:41:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:05,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-30 19:41:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:05,912 INFO L225 Difference]: With dead ends: 687 [2018-12-30 19:41:05,912 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:41:05,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:41:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2018-12-30 19:41:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:41:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:41:06,000 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 100 [2018-12-30 19:41:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:06,001 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:41:06,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:41:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 19:41:06,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:06,006 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:06,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -365392174, now seen corresponding path program 1 times [2018-12-30 19:41:06,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:06,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:06,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:06,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:06,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:06,131 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:41:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:07,412 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2018-12-30 19:41:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:07,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-30 19:41:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:07,420 INFO L225 Difference]: With dead ends: 1054 [2018-12-30 19:41:07,420 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:41:07,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-30 19:41:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:41:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:41:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:41:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2018-12-30 19:41:07,472 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 106 [2018-12-30 19:41:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:07,472 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2018-12-30 19:41:07,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2018-12-30 19:41:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-30 19:41:07,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:07,478 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:07,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -877508142, now seen corresponding path program 1 times [2018-12-30 19:41:07,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:07,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:41:07,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:07,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:07,595 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2018-12-30 19:41:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:09,138 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2018-12-30 19:41:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:09,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-30 19:41:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:09,155 INFO L225 Difference]: With dead ends: 2233 [2018-12-30 19:41:09,155 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:41:09,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:41:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2018-12-30 19:41:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 19:41:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2018-12-30 19:41:09,192 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 107 [2018-12-30 19:41:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:09,193 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2018-12-30 19:41:09,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2018-12-30 19:41:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 19:41:09,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:09,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:09,201 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash 873346348, now seen corresponding path program 1 times [2018-12-30 19:41:09,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:09,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:41:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:09,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:09,330 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2018-12-30 19:41:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:10,601 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2018-12-30 19:41:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:10,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 19:41:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:10,634 INFO L225 Difference]: With dead ends: 2757 [2018-12-30 19:41:10,635 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:41:10,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:41:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2018-12-30 19:41:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:41:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2018-12-30 19:41:10,671 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 123 [2018-12-30 19:41:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:10,672 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2018-12-30 19:41:10,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2018-12-30 19:41:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-30 19:41:10,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:10,676 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:10,676 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash 5388463, now seen corresponding path program 1 times [2018-12-30 19:41:10,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:10,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:10,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-30 19:41:10,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:10,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:10,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:10,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:10,835 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2018-12-30 19:41:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:11,529 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2018-12-30 19:41:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:11,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-12-30 19:41:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:11,539 INFO L225 Difference]: With dead ends: 3281 [2018-12-30 19:41:11,540 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:41:11,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:41:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2018-12-30 19:41:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:41:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2018-12-30 19:41:11,578 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 134 [2018-12-30 19:41:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:11,578 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2018-12-30 19:41:11,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2018-12-30 19:41:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-30 19:41:11,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:11,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:11,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1459525699, now seen corresponding path program 1 times [2018-12-30 19:41:11,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 19:41:11,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:11,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:11,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:11,727 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2018-12-30 19:41:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:12,359 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2018-12-30 19:41:12,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:12,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-30 19:41:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:12,375 INFO L225 Difference]: With dead ends: 3286 [2018-12-30 19:41:12,376 INFO L226 Difference]: Without dead ends: 1712 [2018-12-30 19:41:12,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:41:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2018-12-30 19:41:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2018-12-30 19:41:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:41:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2018-12-30 19:41:12,414 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 142 [2018-12-30 19:41:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:12,415 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2018-12-30 19:41:12,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2018-12-30 19:41:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-30 19:41:12,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:12,420 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:12,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -822596485, now seen corresponding path program 1 times [2018-12-30 19:41:12,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:12,892 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:41:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 19:41:12,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:12,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:41:12,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:41:12,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:41:12,911 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2018-12-30 19:41:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:14,126 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2018-12-30 19:41:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:14,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-12-30 19:41:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:14,142 INFO L225 Difference]: With dead ends: 3805 [2018-12-30 19:41:14,142 INFO L226 Difference]: Without dead ends: 2231 [2018-12-30 19:41:14,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:41:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-12-30 19:41:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2018-12-30 19:41:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2018-12-30 19:41:14,182 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 146 [2018-12-30 19:41:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:14,182 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2018-12-30 19:41:14,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:41:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2018-12-30 19:41:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-30 19:41:14,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:14,188 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:14,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2101585002, now seen corresponding path program 1 times [2018-12-30 19:41:14,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:14,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 19:41:14,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:14,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:14,289 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2018-12-30 19:41:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:15,201 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2018-12-30 19:41:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:15,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2018-12-30 19:41:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:15,211 INFO L225 Difference]: With dead ends: 4067 [2018-12-30 19:41:15,211 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:41:15,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-30 19:41:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:41:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2018-12-30 19:41:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2018-12-30 19:41:15,249 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 149 [2018-12-30 19:41:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:15,250 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2018-12-30 19:41:15,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2018-12-30 19:41:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-30 19:41:15,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:15,254 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:15,254 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash -385356518, now seen corresponding path program 1 times [2018-12-30 19:41:15,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:15,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:15,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 19:41:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:15,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:15,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:15,362 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2018-12-30 19:41:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:15,782 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2018-12-30 19:41:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:15,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-30 19:41:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:15,789 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:41:15,790 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:41:15,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:41:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2018-12-30 19:41:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2018-12-30 19:41:15,826 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 164 [2018-12-30 19:41:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:15,826 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2018-12-30 19:41:15,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2018-12-30 19:41:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-30 19:41:15,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:15,831 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:15,831 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1871280910, now seen corresponding path program 1 times [2018-12-30 19:41:15,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:15,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:15,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-30 19:41:16,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:41:16,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-30 19:41:16,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:16,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:41:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-30 19:41:16,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:41:16,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 19:41:16,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 19:41:16,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 19:41:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 19:41:16,573 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 7 states. [2018-12-30 19:41:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:22,024 INFO L93 Difference]: Finished difference Result 4731 states and 5150 transitions. [2018-12-30 19:41:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 19:41:22,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2018-12-30 19:41:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:22,036 INFO L225 Difference]: With dead ends: 4731 [2018-12-30 19:41:22,036 INFO L226 Difference]: Without dead ends: 2502 [2018-12-30 19:41:22,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-30 19:41:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2018-12-30 19:41:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1838. [2018-12-30 19:41:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1978 transitions. [2018-12-30 19:41:22,084 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1978 transitions. Word has length 193 [2018-12-30 19:41:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:22,084 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 1978 transitions. [2018-12-30 19:41:22,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 19:41:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1978 transitions. [2018-12-30 19:41:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-30 19:41:22,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:22,090 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:22,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash -65531823, now seen corresponding path program 1 times [2018-12-30 19:41:22,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:22,468 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:41:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-30 19:41:22,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:22,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:41:22,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:41:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:41:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:22,924 INFO L87 Difference]: Start difference. First operand 1838 states and 1978 transitions. Second operand 6 states. [2018-12-30 19:41:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:24,210 INFO L93 Difference]: Finished difference Result 3971 states and 4274 transitions. [2018-12-30 19:41:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:24,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-12-30 19:41:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:24,217 INFO L225 Difference]: With dead ends: 3971 [2018-12-30 19:41:24,217 INFO L226 Difference]: Without dead ends: 2135 [2018-12-30 19:41:24,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2018-12-30 19:41:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1838. [2018-12-30 19:41:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1967 transitions. [2018-12-30 19:41:24,257 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1967 transitions. Word has length 249 [2018-12-30 19:41:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:24,257 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2018-12-30 19:41:24,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:41:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1967 transitions. [2018-12-30 19:41:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-30 19:41:24,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:24,263 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:24,264 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1811700774, now seen corresponding path program 1 times [2018-12-30 19:41:24,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 275 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-30 19:41:25,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:41:25,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-30 19:41:25,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:25,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:41:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-12-30 19:41:25,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:41:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 19:41:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 19:41:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 19:41:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-30 19:41:25,633 INFO L87 Difference]: Start difference. First operand 1838 states and 1967 transitions. Second operand 14 states. [2018-12-30 19:41:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:27,785 INFO L93 Difference]: Finished difference Result 3728 states and 3999 transitions. [2018-12-30 19:41:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 19:41:27,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 271 [2018-12-30 19:41:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:27,794 INFO L225 Difference]: With dead ends: 3728 [2018-12-30 19:41:27,794 INFO L226 Difference]: Without dead ends: 1892 [2018-12-30 19:41:27,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-30 19:41:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-30 19:41:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1755. [2018-12-30 19:41:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2018-12-30 19:41:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 1867 transitions. [2018-12-30 19:41:27,830 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 1867 transitions. Word has length 271 [2018-12-30 19:41:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:27,831 INFO L480 AbstractCegarLoop]: Abstraction has 1755 states and 1867 transitions. [2018-12-30 19:41:27,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 19:41:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1867 transitions. [2018-12-30 19:41:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-30 19:41:27,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:27,837 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:27,837 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 990654567, now seen corresponding path program 1 times [2018-12-30 19:41:27,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:27,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-30 19:41:28,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:28,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:28,224 INFO L87 Difference]: Start difference. First operand 1755 states and 1867 transitions. Second operand 4 states. [2018-12-30 19:41:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:29,755 INFO L93 Difference]: Finished difference Result 3637 states and 3882 transitions. [2018-12-30 19:41:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:29,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-12-30 19:41:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:29,757 INFO L225 Difference]: With dead ends: 3637 [2018-12-30 19:41:29,757 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:41:29,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:41:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:41:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:41:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:41:29,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2018-12-30 19:41:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:29,760 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:41:29,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:41:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:41:29,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:41:29,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:29,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:31,479 WARN L181 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2018-12-30 19:41:32,206 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,209 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:41:32,210 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:41:32,211 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:41:32,216 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:41:32,216 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,217 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:41:32,218 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:41:32,219 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a20~0 1)) (.cse11 (= ~a16~0 5))) (let ((.cse1 (or (and .cse8 .cse3 .cse4) (and .cse4 .cse3 .cse11))) (.cse9 (not .cse0)) (.cse7 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse2 (<= 15 ~a8~0)) (.cse12 (<= ~a21~0 0)) (.cse10 (= ~a16~0 4)) (.cse6 (= ~a12~0 8))) (or (and .cse0 .cse1) (and (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (and (and .cse8 .cse1) .cse6) (and .cse2 .cse9 .cse8 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse4) (and .cse6 .cse7 .cse4 .cse11) (and .cse0 .cse12 .cse6 .cse3) (and .cse0 .cse2 .cse4 .cse11) (and .cse10 .cse6 .cse7 .cse4) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and (and .cse2 .cse10 .cse8 .cse4) .cse6) (and .cse2 .cse8 .cse6 .cse4 .cse11) (and .cse0 .cse12 .cse10 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse8 .cse6 (<= ~a20~0 0))))) [2018-12-30 19:41:32,219 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,219 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,219 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,219 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:41:32,220 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:41:32,221 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,222 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:41:32,223 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,224 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a20~0 1)) (.cse11 (= ~a16~0 5))) (let ((.cse1 (or (and .cse9 .cse3 .cse4) (and .cse4 .cse3 .cse11))) (.cse8 (not .cse0)) (.cse7 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse2 (<= 15 ~a8~0)) (.cse12 (<= ~a21~0 0)) (.cse10 (= ~a16~0 4)) (.cse6 (= ~a12~0 8))) (or (and .cse0 .cse1) (and (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (and .cse2 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse4) (and .cse6 .cse7 .cse4 .cse11) (and .cse0 .cse12 .cse6 .cse3) (and (and .cse9 .cse1) .cse6) (and .cse0 .cse2 .cse4 .cse11) (and .cse10 .cse6 .cse7 .cse4) (and .cse2 .cse8 .cse6 .cse7 .cse4 .cse5) (and (and .cse2 .cse10 .cse9 .cse4) .cse6) (and .cse2 .cse9 .cse6 .cse4 .cse11) (and .cse0 .cse12 .cse10 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse9 .cse6 (<= ~a20~0 0))))) [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:41:32,225 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:41:32,226 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,227 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:41:32,228 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,229 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:41:32,230 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:41:32,231 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:41:32,232 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:41:32,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:41:32 BoogieIcfgContainer [2018-12-30 19:41:32,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:41:32,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:41:32,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:41:32,280 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:41:32,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:02" (3/4) ... [2018-12-30 19:41:32,287 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:41:32,311 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:41:32,312 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:41:32,479 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:41:32,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:41:32,480 INFO L168 Benchmark]: Toolchain (without parser) took 34404.77 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 952.7 MB in the beginning and 958.0 MB in the end (delta: -5.3 MB). Peak memory consumption was 476.6 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,481 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:41:32,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.3 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 187.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 920.3 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,482 INFO L168 Benchmark]: Boogie Preprocessor took 81.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,483 INFO L168 Benchmark]: RCFGBuilder took 3523.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,483 INFO L168 Benchmark]: TraceAbstraction took 29627.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.1 MB). Free memory was 1.0 GB in the beginning and 984.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 371.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,484 INFO L168 Benchmark]: Witness Printer took 199.18 ms. Allocated memory is still 1.5 GB. Free memory was 984.3 MB in the beginning and 958.0 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:32,489 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.3 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 187.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 920.3 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3523.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29627.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.1 MB). Free memory was 1.0 GB in the beginning and 984.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 371.1 MB. Max. memory is 11.5 GB. * Witness Printer took 199.18 ms. Allocated memory is still 1.5 GB. Free memory was 984.3 MB in the beginning and 958.0 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((a7 == 1 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5))) || (((((15 <= a8 && a20 == 1) && a21 == 1) && a16 == 6) && a12 == 8) && a17 <= 0)) || ((a17 == 1 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5))) && a12 == 8)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a21 == 1) && a12 == 8)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((a7 == 1 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5))) || (((((15 <= a8 && a20 == 1) && a21 == 1) && a16 == 6) && a12 == 8) && a17 <= 0)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((a17 == 1 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5))) && a12 == 8)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a21 == 1) && a12 == 8)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 29.5s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 3223 SDslu, 174 SDs, 0 SdLazy, 8139 SolverSat, 1009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 482 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2544 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 491 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13571 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 890 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2632 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1734034 SizeOfPredicates, 2 NumberOfNonLiveVariables, 845 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 2235/2266 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...