./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label06_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/Problem15_label06_true-unreach-call.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 58d4b6dfc317f5e767b4dcc7c6f045e3faefc573 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:29:13,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:29:13,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:29:13,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:29:13,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:29:13,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:29:13,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:29:13,032 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:29:13,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:29:13,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:29:13,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:29:13,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:29:13,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:29:13,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:29:13,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:29:13,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:29:13,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:29:13,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:29:13,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:29:13,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:29:13,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:29:13,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:29:13,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:29:13,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:29:13,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:29:13,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:29:13,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:29:13,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:29:13,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:29:13,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:29:13,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:29:13,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:29:13,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:29:13,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:29:13,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:29:13,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:29:13,065 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:29:13,081 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:29:13,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:29:13,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:29:13,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:29:13,083 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:29:13,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:29:13,084 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:29:13,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:29:13,085 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:29:13,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:29:13,086 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:29:13,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:29:13,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:29:13,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:29:13,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:29:13,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:29:13,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:29:13,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:29:13,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:29:13,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:29:13,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:29:13,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:29:13,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:29:13,090 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 -> 58d4b6dfc317f5e767b4dcc7c6f045e3faefc573 [2019-01-12 04:29:13,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:29:13,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:29:13,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:29:13,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:29:13,146 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:29:13,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label06_true-unreach-call.c [2019-01-12 04:29:13,213 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8de769/bfc8e69dd72f4e48bb3b4a8e545cf62a/FLAGd23dac780 [2019-01-12 04:29:13,859 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:29:13,859 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label06_true-unreach-call.c [2019-01-12 04:29:13,877 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8de769/bfc8e69dd72f4e48bb3b4a8e545cf62a/FLAGd23dac780 [2019-01-12 04:29:14,009 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8de769/bfc8e69dd72f4e48bb3b4a8e545cf62a [2019-01-12 04:29:14,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:29:14,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:29:14,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:29:14,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:29:14,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:29:14,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:29:14" (1/1) ... [2019-01-12 04:29:14,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b7e223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:14, skipping insertion in model container [2019-01-12 04:29:14,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:29:14" (1/1) ... [2019-01-12 04:29:14,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:29:14,153 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:29:15,081 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:29:15,094 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:29:15,434 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:29:15,629 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:29:15,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15 WrapperNode [2019-01-12 04:29:15,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:29:15,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:29:15,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:29:15,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:29:15,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:15,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:15,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:29:15,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:29:15,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:29:15,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:29:15,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:15,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:15,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:15,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:16,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:16,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:16,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (1/1) ... [2019-01-12 04:29:16,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:29:16,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:29:16,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:29:16,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:29:16,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (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 [2019-01-12 04:29:16,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:29:16,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:29:23,032 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:29:23,033 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:29:23,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:23 BoogieIcfgContainer [2019-01-12 04:29:23,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:29:23,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:29:23,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:29:23,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:29:23,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:29:14" (1/3) ... [2019-01-12 04:29:23,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70eab946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:23, skipping insertion in model container [2019-01-12 04:29:23,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:15" (2/3) ... [2019-01-12 04:29:23,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70eab946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:23, skipping insertion in model container [2019-01-12 04:29:23,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:23" (3/3) ... [2019-01-12 04:29:23,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label06_true-unreach-call.c [2019-01-12 04:29:23,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:29:23,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:29:23,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:29:23,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:29:23,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:29:23,125 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:29:23,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:29:23,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:29:23,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:29:23,126 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:29:23,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:29:23,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:29:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:29:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 04:29:23,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:23,165 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] [2019-01-12 04:29:23,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2019-01-12 04:29:23,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:23,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:23,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:23,648 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:29:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:23,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:23,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:23,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:23,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:23,692 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:29:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:30,345 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-01-12 04:29:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:30,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-12 04:29:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:30,374 INFO L225 Difference]: With dead ends: 1470 [2019-01-12 04:29:30,374 INFO L226 Difference]: Without dead ends: 978 [2019-01-12 04:29:30,381 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 [2019-01-12 04:29:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-01-12 04:29:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-01-12 04:29:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-01-12 04:29:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-01-12 04:29:30,481 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 56 [2019-01-12 04:29:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:30,482 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-01-12 04:29:30,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-01-12 04:29:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 04:29:30,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:30,487 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:29:30,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1801863949, now seen corresponding path program 1 times [2019-01-12 04:29:30,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:30,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:30,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:30,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:30,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:30,816 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-01-12 04:29:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:36,987 INFO L93 Difference]: Finished difference Result 3754 states and 5689 transitions. [2019-01-12 04:29:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:36,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-01-12 04:29:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:37,004 INFO L225 Difference]: With dead ends: 3754 [2019-01-12 04:29:37,004 INFO L226 Difference]: Without dead ends: 2780 [2019-01-12 04:29:37,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-01-12 04:29:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2476. [2019-01-12 04:29:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-01-12 04:29:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3422 transitions. [2019-01-12 04:29:37,077 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3422 transitions. Word has length 121 [2019-01-12 04:29:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:37,078 INFO L480 AbstractCegarLoop]: Abstraction has 2476 states and 3422 transitions. [2019-01-12 04:29:37,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3422 transitions. [2019-01-12 04:29:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-01-12 04:29:37,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:37,089 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:29:37,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:37,090 INFO L82 PathProgramCache]: Analyzing trace with hash 247520766, now seen corresponding path program 1 times [2019-01-12 04:29:37,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:37,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:37,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-01-12 04:29:37,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:37,743 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 [2019-01-12 04:29:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:37,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-12 04:29:38,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:29:38,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:29:38,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:38,221 INFO L87 Difference]: Start difference. First operand 2476 states and 3422 transitions. Second operand 4 states. [2019-01-12 04:29:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:43,975 INFO L93 Difference]: Finished difference Result 9146 states and 12632 transitions. [2019-01-12 04:29:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:43,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-01-12 04:29:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:44,010 INFO L225 Difference]: With dead ends: 9146 [2019-01-12 04:29:44,011 INFO L226 Difference]: Without dead ends: 6672 [2019-01-12 04:29:44,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2019-01-12 04:29:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 2775. [2019-01-12 04:29:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-01-12 04:29:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3775 transitions. [2019-01-12 04:29:44,099 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3775 transitions. Word has length 317 [2019-01-12 04:29:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:44,100 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3775 transitions. [2019-01-12 04:29:44,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3775 transitions. [2019-01-12 04:29:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-01-12 04:29:44,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:44,106 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:29:44,107 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1612618563, now seen corresponding path program 1 times [2019-01-12 04:29:44,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:44,746 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:29:45,132 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:29:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-12 04:29:45,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:45,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:45,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:29:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:29:45,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:29:45,519 INFO L87 Difference]: Start difference. First operand 2775 states and 3775 transitions. Second operand 5 states. [2019-01-12 04:29:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:50,376 INFO L93 Difference]: Finished difference Result 6746 states and 8862 transitions. [2019-01-12 04:29:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:50,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2019-01-12 04:29:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:50,399 INFO L225 Difference]: With dead ends: 6746 [2019-01-12 04:29:50,399 INFO L226 Difference]: Without dead ends: 3973 [2019-01-12 04:29:50,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:29:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-01-12 04:29:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-01-12 04:29:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-01-12 04:29:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4739 transitions. [2019-01-12 04:29:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4739 transitions. Word has length 347 [2019-01-12 04:29:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:50,472 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4739 transitions. [2019-01-12 04:29:50,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:29:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4739 transitions. [2019-01-12 04:29:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-12 04:29:50,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:50,482 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:29:50,482 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash -424795093, now seen corresponding path program 1 times [2019-01-12 04:29:50,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:50,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:50,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:50,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:50,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:51,153 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:51,402 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:51,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:51,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:51,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:51,674 INFO L87 Difference]: Start difference. First operand 3673 states and 4739 transitions. Second operand 6 states. [2019-01-12 04:29:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:55,894 INFO L93 Difference]: Finished difference Result 7702 states and 9892 transitions. [2019-01-12 04:29:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:29:55,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 421 [2019-01-12 04:29:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:55,912 INFO L225 Difference]: With dead ends: 7702 [2019-01-12 04:29:55,912 INFO L226 Difference]: Without dead ends: 4031 [2019-01-12 04:29:55,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-01-12 04:29:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3972. [2019-01-12 04:29:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-01-12 04:29:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 4711 transitions. [2019-01-12 04:29:55,994 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 4711 transitions. Word has length 421 [2019-01-12 04:29:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 3972 states and 4711 transitions. [2019-01-12 04:29:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:29:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 4711 transitions. [2019-01-12 04:29:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-01-12 04:29:56,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:56,006 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:29:56,006 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1755967919, now seen corresponding path program 1 times [2019-01-12 04:29:56,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:56,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:56,522 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:29:56,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:56,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:56,851 INFO L87 Difference]: Start difference. First operand 3972 states and 4711 transitions. Second operand 6 states. [2019-01-12 04:30:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:00,942 INFO L93 Difference]: Finished difference Result 8923 states and 10805 transitions. [2019-01-12 04:30:00,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:30:00,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 438 [2019-01-12 04:30:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:00,963 INFO L225 Difference]: With dead ends: 8923 [2019-01-12 04:30:00,964 INFO L226 Difference]: Without dead ends: 4953 [2019-01-12 04:30:00,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:30:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2019-01-12 04:30:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 4868. [2019-01-12 04:30:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-01-12 04:30:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 5719 transitions. [2019-01-12 04:30:01,055 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 5719 transitions. Word has length 438 [2019-01-12 04:30:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:01,056 INFO L480 AbstractCegarLoop]: Abstraction has 4868 states and 5719 transitions. [2019-01-12 04:30:01,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:30:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 5719 transitions. [2019-01-12 04:30:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-01-12 04:30:01,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:01,083 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:01,083 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:01,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1938760407, now seen corresponding path program 1 times [2019-01-12 04:30:01,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:01,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:01,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:30:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:01,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:30:01,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:30:01,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:30:01,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:01,673 INFO L87 Difference]: Start difference. First operand 4868 states and 5719 transitions. Second operand 5 states. [2019-01-12 04:30:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:07,120 INFO L93 Difference]: Finished difference Result 17215 states and 20176 transitions. [2019-01-12 04:30:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:30:07,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 557 [2019-01-12 04:30:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:07,164 INFO L225 Difference]: With dead ends: 17215 [2019-01-12 04:30:07,165 INFO L226 Difference]: Without dead ends: 12349 [2019-01-12 04:30:07,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12349 states. [2019-01-12 04:30:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12349 to 6063. [2019-01-12 04:30:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6063 states. [2019-01-12 04:30:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6063 states to 6063 states and 7087 transitions. [2019-01-12 04:30:07,313 INFO L78 Accepts]: Start accepts. Automaton has 6063 states and 7087 transitions. Word has length 557 [2019-01-12 04:30:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:07,315 INFO L480 AbstractCegarLoop]: Abstraction has 6063 states and 7087 transitions. [2019-01-12 04:30:07,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:30:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6063 states and 7087 transitions. [2019-01-12 04:30:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-01-12 04:30:07,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:07,325 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:30:07,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1956262646, now seen corresponding path program 1 times [2019-01-12 04:30:07,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:07,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 633 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-01-12 04:30:08,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:08,570 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 [2019-01-12 04:30:08,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:08,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-01-12 04:30:08,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:30:08,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:30:08,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:30:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:30:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:30:08,961 INFO L87 Difference]: Start difference. First operand 6063 states and 7087 transitions. Second operand 8 states. [2019-01-12 04:30:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:16,824 INFO L93 Difference]: Finished difference Result 14972 states and 17578 transitions. [2019-01-12 04:30:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:30:16,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 602 [2019-01-12 04:30:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:16,839 INFO L225 Difference]: With dead ends: 14972 [2019-01-12 04:30:16,839 INFO L226 Difference]: Without dead ends: 7559 [2019-01-12 04:30:16,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 605 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:30:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-01-12 04:30:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 7260. [2019-01-12 04:30:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-01-12 04:30:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 8087 transitions. [2019-01-12 04:30:16,941 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 8087 transitions. Word has length 602 [2019-01-12 04:30:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:16,941 INFO L480 AbstractCegarLoop]: Abstraction has 7260 states and 8087 transitions. [2019-01-12 04:30:16,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:30:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 8087 transitions. [2019-01-12 04:30:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2019-01-12 04:30:16,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:16,951 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:16,952 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -593069797, now seen corresponding path program 1 times [2019-01-12 04:30:16,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:16,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:16,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:30:17,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:17,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:30:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:30:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:17,542 INFO L87 Difference]: Start difference. First operand 7260 states and 8087 transitions. Second operand 3 states. [2019-01-12 04:30:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:19,553 INFO L93 Difference]: Finished difference Result 16909 states and 18972 transitions. [2019-01-12 04:30:19,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:30:19,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 610 [2019-01-12 04:30:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:19,571 INFO L225 Difference]: With dead ends: 16909 [2019-01-12 04:30:19,571 INFO L226 Difference]: Without dead ends: 9651 [2019-01-12 04:30:19,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9651 states. [2019-01-12 04:30:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9651 to 9651. [2019-01-12 04:30:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9651 states. [2019-01-12 04:30:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9651 states to 9651 states and 10706 transitions. [2019-01-12 04:30:19,718 INFO L78 Accepts]: Start accepts. Automaton has 9651 states and 10706 transitions. Word has length 610 [2019-01-12 04:30:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:19,719 INFO L480 AbstractCegarLoop]: Abstraction has 9651 states and 10706 transitions. [2019-01-12 04:30:19,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:30:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9651 states and 10706 transitions. [2019-01-12 04:30:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-01-12 04:30:19,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:19,734 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:19,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash -429737129, now seen corresponding path program 1 times [2019-01-12 04:30:19,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:19,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:19,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:19,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-01-12 04:30:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:20,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:20,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:30:20,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:30:20,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:20,178 INFO L87 Difference]: Start difference. First operand 9651 states and 10706 transitions. Second operand 3 states. [2019-01-12 04:30:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:22,745 INFO L93 Difference]: Finished difference Result 19298 states and 21408 transitions. [2019-01-12 04:30:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:30:22,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2019-01-12 04:30:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:22,764 INFO L225 Difference]: With dead ends: 19298 [2019-01-12 04:30:22,765 INFO L226 Difference]: Without dead ends: 9649 [2019-01-12 04:30:22,775 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 [2019-01-12 04:30:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9649 states. [2019-01-12 04:30:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9649 to 9649. [2019-01-12 04:30:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9649 states. [2019-01-12 04:30:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9649 states to 9649 states and 10702 transitions. [2019-01-12 04:30:23,105 INFO L78 Accepts]: Start accepts. Automaton has 9649 states and 10702 transitions. Word has length 653 [2019-01-12 04:30:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:23,105 INFO L480 AbstractCegarLoop]: Abstraction has 9649 states and 10702 transitions. [2019-01-12 04:30:23,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:30:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9649 states and 10702 transitions. [2019-01-12 04:30:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-01-12 04:30:23,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:23,126 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:23,127 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2036261057, now seen corresponding path program 1 times [2019-01-12 04:30:23,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:30:23,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:23,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:23,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:23,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:23,783 INFO L87 Difference]: Start difference. First operand 9649 states and 10702 transitions. Second operand 4 states. [2019-01-12 04:30:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:26,721 INFO L93 Difference]: Finished difference Result 19294 states and 21399 transitions. [2019-01-12 04:30:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:26,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 687 [2019-01-12 04:30:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:26,739 INFO L225 Difference]: With dead ends: 19294 [2019-01-12 04:30:26,740 INFO L226 Difference]: Without dead ends: 9647 [2019-01-12 04:30:26,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2019-01-12 04:30:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 9647. [2019-01-12 04:30:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9647 states. [2019-01-12 04:30:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9647 states to 9647 states and 10352 transitions. [2019-01-12 04:30:26,880 INFO L78 Accepts]: Start accepts. Automaton has 9647 states and 10352 transitions. Word has length 687 [2019-01-12 04:30:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:26,882 INFO L480 AbstractCegarLoop]: Abstraction has 9647 states and 10352 transitions. [2019-01-12 04:30:26,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9647 states and 10352 transitions. [2019-01-12 04:30:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-01-12 04:30:26,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:26,899 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:30:26,899 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1403579945, now seen corresponding path program 1 times [2019-01-12 04:30:26,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:27,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:27,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:27,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:27,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:27,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:27,723 INFO L87 Difference]: Start difference. First operand 9647 states and 10352 transitions. Second operand 4 states. [2019-01-12 04:30:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:30,322 INFO L93 Difference]: Finished difference Result 20153 states and 21452 transitions. [2019-01-12 04:30:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:30,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 714 [2019-01-12 04:30:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:30,334 INFO L225 Difference]: With dead ends: 20153 [2019-01-12 04:30:30,335 INFO L226 Difference]: Without dead ends: 7817 [2019-01-12 04:30:30,345 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 [2019-01-12 04:30:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7817 states. [2019-01-12 04:30:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7817 to 6019. [2019-01-12 04:30:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6019 states. [2019-01-12 04:30:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6019 states to 6019 states and 6193 transitions. [2019-01-12 04:30:30,421 INFO L78 Accepts]: Start accepts. Automaton has 6019 states and 6193 transitions. Word has length 714 [2019-01-12 04:30:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:30,422 INFO L480 AbstractCegarLoop]: Abstraction has 6019 states and 6193 transitions. [2019-01-12 04:30:30,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6019 states and 6193 transitions. [2019-01-12 04:30:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-01-12 04:30:30,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:30,433 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:30,433 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash -291271216, now seen corresponding path program 1 times [2019-01-12 04:30:30,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-01-12 04:30:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:31,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:30:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:30:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:31,483 INFO L87 Difference]: Start difference. First operand 6019 states and 6193 transitions. Second operand 3 states. [2019-01-12 04:30:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:33,312 INFO L93 Difference]: Finished difference Result 15630 states and 16098 transitions. [2019-01-12 04:30:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:30:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 738 [2019-01-12 04:30:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:33,324 INFO L225 Difference]: With dead ends: 15630 [2019-01-12 04:30:33,325 INFO L226 Difference]: Without dead ends: 9314 [2019-01-12 04:30:33,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9314 states. [2019-01-12 04:30:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9314 to 7214. [2019-01-12 04:30:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-01-12 04:30:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 7421 transitions. [2019-01-12 04:30:33,404 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 7421 transitions. Word has length 738 [2019-01-12 04:30:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:33,405 INFO L480 AbstractCegarLoop]: Abstraction has 7214 states and 7421 transitions. [2019-01-12 04:30:33,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:30:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 7421 transitions. [2019-01-12 04:30:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2019-01-12 04:30:33,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:33,416 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:30:33,417 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1693494150, now seen corresponding path program 1 times [2019-01-12 04:30:33,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:33,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:33,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-01-12 04:30:34,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:34,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:34,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:30:34,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:30:34,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:34,419 INFO L87 Difference]: Start difference. First operand 7214 states and 7421 transitions. Second operand 3 states. [2019-01-12 04:30:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:35,845 INFO L93 Difference]: Finished difference Result 15023 states and 15456 transitions. [2019-01-12 04:30:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:30:35,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 928 [2019-01-12 04:30:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:35,854 INFO L225 Difference]: With dead ends: 15023 [2019-01-12 04:30:35,855 INFO L226 Difference]: Without dead ends: 7811 [2019-01-12 04:30:35,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:30:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7811 states. [2019-01-12 04:30:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7811 to 7213. [2019-01-12 04:30:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-01-12 04:30:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 7419 transitions. [2019-01-12 04:30:35,918 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 7419 transitions. Word has length 928 [2019-01-12 04:30:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:35,919 INFO L480 AbstractCegarLoop]: Abstraction has 7213 states and 7419 transitions. [2019-01-12 04:30:35,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:30:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 7419 transitions. [2019-01-12 04:30:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2019-01-12 04:30:35,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:35,932 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:35,932 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash 135919230, now seen corresponding path program 1 times [2019-01-12 04:30:35,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:35,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:36,772 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:30:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 54 proven. 750 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-01-12 04:30:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:38,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:30:38,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:38,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:39,710 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_825 Int)) (and (<= (+ v_~a0~0_825 44) 0) (<= (mod v_~a0~0_825 299926) (+ c_~a0~0 300074)) (<= 0 v_~a0~0_825))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299926))) (and (not (= .cse0 0)) (< v_prenex_1 0) (<= (+ v_prenex_1 44) 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (= .cse1 0) (<= (+ v_prenex_2 44) 0) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2019-01-12 04:30:40,455 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-12 04:30:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 480 trivial. 643 not checked. [2019-01-12 04:30:43,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:30:43,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:30:43,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:30:43,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:30:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2019-01-12 04:30:43,916 INFO L87 Difference]: Start difference. First operand 7213 states and 7419 transitions. Second operand 9 states. [2019-01-12 04:30:51,340 WARN L181 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2019-01-12 04:30:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:56,355 INFO L93 Difference]: Finished difference Result 16443 states and 16847 transitions. [2019-01-12 04:30:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:30:56,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 949 [2019-01-12 04:30:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:56,358 INFO L225 Difference]: With dead ends: 16443 [2019-01-12 04:30:56,358 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:30:56,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=43, Invalid=69, Unknown=2, NotChecked=18, Total=132 [2019-01-12 04:30:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:30:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:30:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:30:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:30:56,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 949 [2019-01-12 04:30:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:56,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:30:56,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:30:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:30:56,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:30:56,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:30:56,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:56,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:56,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:56,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,034 WARN L181 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 224 [2019-01-12 04:30:57,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,710 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 224 [2019-01-12 04:30:57,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:57,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:58,056 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 210 [2019-01-12 04:31:00,473 WARN L181 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 217 DAG size of output: 83 [2019-01-12 04:31:02,203 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 217 DAG size of output: 83 [2019-01-12 04:31:03,707 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 202 DAG size of output: 85 [2019-01-12 04:31:03,711 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,712 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,713 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,714 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:31:03,715 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:31:03,716 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:31:03,716 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,717 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:31:03,718 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:31:03,719 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,720 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,721 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,722 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:31:03,722 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,723 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,723 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,723 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:31:03,724 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,725 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,726 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,726 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,726 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,726 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,727 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,728 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,729 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:31:03,730 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,731 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,732 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,737 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,738 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,739 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse17 (+ ~a0~0 44)) (.cse18 (<= (+ ~a4~0 86) 0))) (let ((.cse5 (< 0 (+ ~a0~0 147))) (.cse20 (and .cse18 (not (= 2 ~a2~0)))) (.cse8 (= ~a2~0 1)) (.cse19 (<= 0 .cse17)) (.cse15 (+ ~a29~0 144))) (let ((.cse6 (<= ~a29~0 43)) (.cse9 (< 0 .cse15)) (.cse7 (<= 0 (+ ~a4~0 85))) (.cse16 (or (and .cse18 .cse8) (and .cse8 .cse19))) (.cse3 (<= 5 ~a2~0)) (.cse1 (or .cse19 .cse20)) (.cse12 (or (and .cse18 .cse5) .cse19 .cse20)) (.cse14 (= ~a2~0 3)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse11 (= ~a2~0 2)) (.cse4 (<= (+ ~a4~0 42) 0)) (.cse2 (= ~a2~0 4)) (.cse13 (<= (+ ~a0~0 99) 0)) (.cse10 (<= 0 (+ ~a0~0 600000)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse5) (and .cse4 .cse1 .cse2 .cse6) (and .cse7 .cse4 .cse8 .cse6 .cse9 .cse10) (or (and (<= (+ ~a4~0 89) 0) .cse11 .cse6) (and .cse4 (and .cse11 .cse12))) (and .cse4 .cse13 .cse14) (and (<= .cse15 0) .cse16 (<= (+ ~a0~0 61) 0)) (and .cse4 .cse8 .cse13 .cse10) (and .cse4 (and .cse6 .cse9 .cse16) (<= .cse17 0)) (and .cse7 .cse4 .cse13 .cse11 .cse10) (and .cse0 .cse7 .cse4 .cse8 .cse5) (and .cse3 .cse4 .cse13 .cse10) (and .cse13 .cse16) (and .cse3 .cse4 .cse1) (and .cse4 (and .cse12 .cse14)) (and .cse0 .cse4 (and .cse11 .cse5)) (and .cse4 .cse2 .cse13 .cse10))))) [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,740 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,741 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,742 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse14 (+ ~a0~0 44))) (let ((.cse17 (+ ~a29~0 144)) (.cse16 (<= (+ ~a4~0 86) 0)) (.cse5 (= ~a2~0 1)) (.cse18 (<= 0 .cse14))) (let ((.cse1 (= ~a2~0 3)) (.cse9 (<= 5 ~a2~0)) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse11 (or (and .cse16 .cse5) (and .cse5 .cse18))) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse13 (< 0 .cse17)) (.cse2 (or .cse18 (and .cse16 (not (= 2 ~a2~0))))) (.cse12 (<= ~a29~0 43)) (.cse10 (= ~a2~0 2)) (.cse7 (< 0 (+ ~a0~0 147))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse15 (= ~a2~0 4)) (.cse3 (<= (+ ~a0~0 99) 0)) (.cse8 (<= 0 (+ ~a0~0 600000)))) (or (and .cse0 (and .cse1 .cse2)) (and .cse0 .cse3 .cse1) (and .cse4 .cse0 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse3 .cse8) (and .cse2 .cse9 .cse0) (and (and .cse6 .cse0 .cse10) .cse7) (and .cse4 .cse0 .cse3 .cse10 .cse8) (and .cse9 .cse0 .cse3 .cse8) (and .cse11 .cse3) (and .cse7 (and .cse9 .cse6 .cse0)) (and .cse0 (and .cse12 .cse13 .cse11) (<= .cse14 0)) (and .cse2 .cse6 .cse15) (and .cse16 .cse11 (<= .cse17 0)) (and .cse5 .cse4 .cse0 .cse12 .cse13 .cse8) (and .cse2 .cse0 .cse15 .cse12) (or (and (<= (+ ~a4~0 89) 0) .cse10 .cse12) (and .cse0 (and .cse10 (or (and .cse16 .cse7) .cse18)))) (and .cse0 .cse15 .cse3 .cse8))))) [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,743 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,744 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,745 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,745 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,749 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,750 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:31:03,751 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:31:03,752 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse14 (+ ~a0~0 44))) (let ((.cse17 (+ ~a29~0 144)) (.cse16 (<= (+ ~a4~0 86) 0)) (.cse5 (= ~a2~0 1)) (.cse18 (<= 0 .cse14))) (let ((.cse1 (= ~a2~0 3)) (.cse9 (<= 5 ~a2~0)) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse11 (or (and .cse16 .cse5) (and .cse5 .cse18))) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse13 (< 0 .cse17)) (.cse2 (or .cse18 (and .cse16 (not (= 2 ~a2~0))))) (.cse12 (<= ~a29~0 43)) (.cse10 (= ~a2~0 2)) (.cse7 (< 0 (+ ~a0~0 147))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse15 (= ~a2~0 4)) (.cse3 (<= (+ ~a0~0 99) 0)) (.cse8 (<= 0 (+ ~a0~0 600000)))) (or (and .cse0 (and .cse1 .cse2)) (and .cse0 .cse3 .cse1) (and .cse4 .cse0 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse3 .cse8) (and .cse2 .cse9 .cse0) (and (and .cse6 .cse0 .cse10) .cse7) (and .cse4 .cse0 .cse3 .cse10 .cse8) (and .cse9 .cse0 .cse3 .cse8) (and .cse11 .cse3) (and .cse7 (and .cse9 .cse6 .cse0)) (and .cse0 (and .cse12 .cse13 .cse11) (<= .cse14 0)) (and .cse2 .cse6 .cse15) (and .cse16 .cse11 (<= .cse17 0)) (and .cse5 .cse4 .cse0 .cse12 .cse13 .cse8) (and .cse2 .cse0 .cse15 .cse12) (or (and (<= (+ ~a4~0 89) 0) .cse10 .cse12) (and .cse0 (and .cse10 (or (and .cse16 .cse7) .cse18)))) (and .cse0 .cse15 .cse3 .cse8))))) [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:31:03,753 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:31:03,754 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:31:03,755 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,755 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,755 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,755 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,756 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,757 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,758 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,760 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,761 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,762 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,763 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,763 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:31:03,764 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:31:03,765 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:31:03,766 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:31:03,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:31:03 BoogieIcfgContainer [2019-01-12 04:31:03,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:31:03,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:31:03,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:31:03,841 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:31:03,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:23" (3/4) ... [2019-01-12 04:31:03,846 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:31:03,902 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:31:03,906 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:31:04,198 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:31:04,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:31:04,200 INFO L168 Benchmark]: Toolchain (without parser) took 110185.67 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 945.8 MB in the beginning and 1.8 GB in the end (delta: -886.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,201 INFO L168 Benchmark]: CDTParser took 0.18 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. [2019-01-12 04:31:04,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1611.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 244.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,205 INFO L168 Benchmark]: Boogie Preprocessor took 389.32 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,206 INFO L168 Benchmark]: RCFGBuilder took 6768.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.5 MB). Peak memory consumption was 304.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,209 INFO L168 Benchmark]: TraceAbstraction took 100803.44 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -714.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,210 INFO L168 Benchmark]: Witness Printer took 359.92 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 84.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:31:04,215 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.18 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 1611.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 244.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 389.32 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6768.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.5 MB). Peak memory consumption was 304.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100803.44 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -714.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 359.92 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 84.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 1766]: Loop Invariant Derived loop invariant: ((((((((((((((((a4 + 42 <= 0 && a2 == 3 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2)))) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a2 == 1) && a0 + 98 <= 0) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a2 == 1) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && 5 <= a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2) && 0 < a0 + 147)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 99 <= 0) && a2 == 2) && 0 <= a0 + 600000)) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 99 <= 0)) || (0 < a0 + 147 && (5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 44 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 98 <= 0) && a2 == 4)) || ((a4 + 86 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a29 + 144 <= 0)) || (((((a2 == 1 && 0 <= a4 + 85) && a4 + 42 <= 0) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || ((((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a4 + 42 <= 0) && a2 == 4) && a29 <= 43)) || ((a4 + 89 <= 0 && a2 == 2) && a29 <= 43) || (a4 + 42 <= 0 && a2 == 2 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44))) || (((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && 0 <= a0 + 600000) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((a4 + 42 <= 0 && a2 == 3 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2)))) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a2 == 1) && a0 + 98 <= 0) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a2 == 1) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && 5 <= a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2) && 0 < a0 + 147)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 99 <= 0) && a2 == 2) && 0 <= a0 + 600000)) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 99 <= 0)) || (0 < a0 + 147 && (5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 44 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 98 <= 0) && a2 == 4)) || ((a4 + 86 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a29 + 144 <= 0)) || (((((a2 == 1 && 0 <= a4 + 85) && a4 + 42 <= 0) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || ((((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a4 + 42 <= 0) && a2 == 4) && a29 <= 43)) || ((a4 + 89 <= 0 && a2 == 2) && a29 <= 43) || (a4 + 42 <= 0 && a2 == 2 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44))) || (((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && 0 <= a0 + 600000) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((a0 + 98 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2)))) && a2 == 4) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2)))) && a2 == 4) && a29 <= 43)) || (((((0 <= a4 + 85 && a4 + 42 <= 0) && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || ((a4 + 89 <= 0 && a2 == 2) && a29 <= 43) || (a4 + 42 <= 0 && a2 == 2 && (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) || (a4 + 86 <= 0 && !(2 == a2))))) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || ((a29 + 144 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 44 <= 0)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 99 <= 0) && a2 == 2) && 0 <= a0 + 600000)) || ((((a0 + 98 <= 0 && 0 <= a4 + 85) && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 600000)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((5 <= a2 && a4 + 42 <= 0) && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || (a4 + 42 <= 0 && (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) || (a4 + 86 <= 0 && !(2 == a2))) && a2 == 3)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2 && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && 0 <= a0 + 600000) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 100.6s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 71.3s AutomataDifference, 0.0s DeadEndRemovalTime, 7.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4126 SDtfs, 10753 SDslu, 1124 SDs, 0 SdLazy, 28668 SolverSat, 4413 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 55.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1953 GetRequests, 1893 SyntacticMatches, 12 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9651occurred in iteration=9, 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: 1.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 15728 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 219 NumberOfFragments, 1296 HoareAnnotationTreeSize, 4 FomulaSimplifications, 345101 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 114175 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 10006 NumberOfCodeBlocks, 10006 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 9988 ConstructedInterpolants, 296 QuantifiedInterpolants, 36932518 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2222 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 9901/11461 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...