./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem02_label14.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 bf623cbfa27d5f25c20ae418fc6508fd949965cd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:53:06,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:53:06,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:53:06,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:53:06,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:53:06,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:53:06,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:53:06,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:53:06,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:53:06,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:53:06,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:53:06,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:53:06,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:53:06,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:53:06,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:53:06,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:53:06,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:53:06,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:53:06,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:53:06,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:53:06,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:53:06,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:53:06,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:53:06,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:53:06,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:53:06,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:53:06,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:53:06,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:53:06,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:53:06,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:53:06,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:53:06,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:53:06,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:53:06,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:53:06,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:53:06,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:53:06,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:53:06,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:53:06,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:53:06,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:53:06,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:53:06,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:53:06,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:53:06,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:53:06,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:53:06,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:53:06,136 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:53:06,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:53:06,139 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:53:06,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:53:06,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:53:06,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:53:06,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:53:06,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:53:06,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:53:06,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:53:06,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:53:06,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:53:06,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:53:06,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:53:06,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:53:06,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:53:06,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:53:06,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:53:06,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:53:06,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:53:06,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:53:06,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:53:06,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:53:06,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:53:06,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> bf623cbfa27d5f25c20ae418fc6508fd949965cd [2019-11-19 20:53:06,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:53:06,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:53:06,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:53:06,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:53:06,481 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:53:06,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-19 20:53:06,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebc28355/4368992560fc4039ab13f892d1347df1/FLAGabe375f2c [2019-11-19 20:53:07,099 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:53:07,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-19 20:53:07,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebc28355/4368992560fc4039ab13f892d1347df1/FLAGabe375f2c [2019-11-19 20:53:07,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebc28355/4368992560fc4039ab13f892d1347df1 [2019-11-19 20:53:07,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:53:07,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:53:07,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:07,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:53:07,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:53:07,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:07" (1/1) ... [2019-11-19 20:53:07,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9141f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:07, skipping insertion in model container [2019-11-19 20:53:07,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:07" (1/1) ... [2019-11-19 20:53:07,430 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:53:07,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:53:07,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:07,940 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:53:08,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:08,159 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:53:08,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08 WrapperNode [2019-11-19 20:53:08,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:08,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:08,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:53:08,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:53:08,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:08,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:53:08,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:53:08,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:53:08,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (1/1) ... [2019-11-19 20:53:08,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:53:08,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:53:08,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:53:08,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:53:08,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (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-11-19 20:53:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:53:08,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:53:09,783 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:53:09,784 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:53:09,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:09 BoogieIcfgContainer [2019-11-19 20:53:09,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:53:09,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:53:09,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:53:09,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:53:09,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:53:07" (1/3) ... [2019-11-19 20:53:09,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95826f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:09, skipping insertion in model container [2019-11-19 20:53:09,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:08" (2/3) ... [2019-11-19 20:53:09,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95826f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:09, skipping insertion in model container [2019-11-19 20:53:09,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:09" (3/3) ... [2019-11-19 20:53:09,796 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-11-19 20:53:09,807 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:53:09,816 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:53:09,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:53:09,860 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:53:09,860 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:53:09,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:53:09,861 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:53:09,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:53:09,861 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:53:09,861 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:53:09,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:53:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-19 20:53:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 20:53:09,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:09,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:53:09,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:09,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:09,907 INFO L82 PathProgramCache]: Analyzing trace with hash 906683963, now seen corresponding path program 1 times [2019-11-19 20:53:09,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:09,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610250838] [2019-11-19 20:53:09,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:10,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610250838] [2019-11-19 20:53:10,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:10,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977924636] [2019-11-19 20:53:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:10,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:10,435 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-19 20:53:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:11,899 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-11-19 20:53:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:11,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-19 20:53:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:11,922 INFO L225 Difference]: With dead ends: 739 [2019-11-19 20:53:11,922 INFO L226 Difference]: Without dead ends: 445 [2019-11-19 20:53:11,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-19 20:53:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-11-19 20:53:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-19 20:53:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-11-19 20:53:12,005 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 117 [2019-11-19 20:53:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:12,010 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-11-19 20:53:12,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-11-19 20:53:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-19 20:53:12,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:12,021 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 20:53:12,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash -904416550, now seen corresponding path program 1 times [2019-11-19 20:53:12,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:12,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877223438] [2019-11-19 20:53:12,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:12,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877223438] [2019-11-19 20:53:12,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:12,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:12,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088241654] [2019-11-19 20:53:12,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:12,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:12,193 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-11-19 20:53:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:13,061 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-11-19 20:53:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:13,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-19 20:53:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:13,068 INFO L225 Difference]: With dead ends: 1470 [2019-11-19 20:53:13,068 INFO L226 Difference]: Without dead ends: 1027 [2019-11-19 20:53:13,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-19 20:53:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-11-19 20:53:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-19 20:53:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-11-19 20:53:13,126 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 135 [2019-11-19 20:53:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:13,126 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-11-19 20:53:13,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-11-19 20:53:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-19 20:53:13,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:13,138 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 20:53:13,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 793603343, now seen corresponding path program 1 times [2019-11-19 20:53:13,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:13,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495852954] [2019-11-19 20:53:13,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:13,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495852954] [2019-11-19 20:53:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:13,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:13,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375061117] [2019-11-19 20:53:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:13,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:13,240 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-11-19 20:53:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:14,345 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-11-19 20:53:14,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:14,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-19 20:53:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:14,356 INFO L225 Difference]: With dead ends: 2582 [2019-11-19 20:53:14,356 INFO L226 Difference]: Without dead ends: 1855 [2019-11-19 20:53:14,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-11-19 20:53:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-11-19 20:53:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-11-19 20:53:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2142 transitions. [2019-11-19 20:53:14,430 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2142 transitions. Word has length 139 [2019-11-19 20:53:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:14,431 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 2142 transitions. [2019-11-19 20:53:14,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2142 transitions. [2019-11-19 20:53:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-19 20:53:14,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:14,435 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 20:53:14,436 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1415237092, now seen corresponding path program 1 times [2019-11-19 20:53:14,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:14,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215670446] [2019-11-19 20:53:14,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:14,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215670446] [2019-11-19 20:53:14,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:14,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:53:14,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92122870] [2019-11-19 20:53:14,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:14,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:14,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:14,513 INFO L87 Difference]: Start difference. First operand 1570 states and 2142 transitions. Second operand 3 states. [2019-11-19 20:53:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:15,092 INFO L93 Difference]: Finished difference Result 3840 states and 5195 transitions. [2019-11-19 20:53:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:15,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-19 20:53:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:15,105 INFO L225 Difference]: With dead ends: 3840 [2019-11-19 20:53:15,106 INFO L226 Difference]: Without dead ends: 2272 [2019-11-19 20:53:15,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-11-19 20:53:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2132. [2019-11-19 20:53:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-19 20:53:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2655 transitions. [2019-11-19 20:53:15,163 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2655 transitions. Word has length 139 [2019-11-19 20:53:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:15,163 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2655 transitions. [2019-11-19 20:53:15,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2655 transitions. [2019-11-19 20:53:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 20:53:15,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:15,169 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 20:53:15,169 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1487828793, now seen corresponding path program 1 times [2019-11-19 20:53:15,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:15,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716794908] [2019-11-19 20:53:15,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 20:53:15,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716794908] [2019-11-19 20:53:15,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:15,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:15,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603258421] [2019-11-19 20:53:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:15,325 INFO L87 Difference]: Start difference. First operand 2132 states and 2655 transitions. Second operand 4 states. [2019-11-19 20:53:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:16,272 INFO L93 Difference]: Finished difference Result 4827 states and 6005 transitions. [2019-11-19 20:53:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:16,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-19 20:53:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:16,284 INFO L225 Difference]: With dead ends: 4827 [2019-11-19 20:53:16,284 INFO L226 Difference]: Without dead ends: 2273 [2019-11-19 20:53:16,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-19 20:53:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2270. [2019-11-19 20:53:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-11-19 20:53:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 2534 transitions. [2019-11-19 20:53:16,332 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 2534 transitions. Word has length 144 [2019-11-19 20:53:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:16,333 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 2534 transitions. [2019-11-19 20:53:16,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2534 transitions. [2019-11-19 20:53:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-19 20:53:16,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:16,340 INFO L410 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, 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] [2019-11-19 20:53:16,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1645622840, now seen corresponding path program 1 times [2019-11-19 20:53:16,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:16,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318644643] [2019-11-19 20:53:16,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 20:53:16,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318644643] [2019-11-19 20:53:16,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:16,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:16,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221313621] [2019-11-19 20:53:16,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:16,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:16,412 INFO L87 Difference]: Start difference. First operand 2270 states and 2534 transitions. Second operand 3 states. [2019-11-19 20:53:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:16,963 INFO L93 Difference]: Finished difference Result 5376 states and 5995 transitions. [2019-11-19 20:53:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:16,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-19 20:53:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:16,975 INFO L225 Difference]: With dead ends: 5376 [2019-11-19 20:53:16,976 INFO L226 Difference]: Without dead ends: 3108 [2019-11-19 20:53:16,979 INFO L630 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-11-19 20:53:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-11-19 20:53:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2128. [2019-11-19 20:53:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-19 20:53:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2362 transitions. [2019-11-19 20:53:17,029 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2362 transitions. Word has length 185 [2019-11-19 20:53:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:17,030 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 2362 transitions. [2019-11-19 20:53:17,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2362 transitions. [2019-11-19 20:53:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-19 20:53:17,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:17,036 INFO L410 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, 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] [2019-11-19 20:53:17,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1280460365, now seen corresponding path program 1 times [2019-11-19 20:53:17,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:17,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475547650] [2019-11-19 20:53:17,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:17,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475547650] [2019-11-19 20:53:17,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:17,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:53:17,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521461546] [2019-11-19 20:53:17,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 20:53:17,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:53:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:53:17,388 INFO L87 Difference]: Start difference. First operand 2128 states and 2362 transitions. Second operand 7 states. [2019-11-19 20:53:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:18,718 INFO L93 Difference]: Finished difference Result 4693 states and 5195 transitions. [2019-11-19 20:53:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 20:53:18,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-11-19 20:53:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:18,728 INFO L225 Difference]: With dead ends: 4693 [2019-11-19 20:53:18,729 INFO L226 Difference]: Without dead ends: 2286 [2019-11-19 20:53:18,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:53:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2019-11-19 20:53:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2127. [2019-11-19 20:53:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-11-19 20:53:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2354 transitions. [2019-11-19 20:53:18,771 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2354 transitions. Word has length 185 [2019-11-19 20:53:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:18,772 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 2354 transitions. [2019-11-19 20:53:18,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 20:53:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2354 transitions. [2019-11-19 20:53:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-19 20:53:18,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:18,778 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 20:53:18,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1003780014, now seen corresponding path program 1 times [2019-11-19 20:53:18,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:18,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338100292] [2019-11-19 20:53:18,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:18,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338100292] [2019-11-19 20:53:18,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:18,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:18,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622022707] [2019-11-19 20:53:18,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:18,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:18,958 INFO L87 Difference]: Start difference. First operand 2127 states and 2354 transitions. Second operand 4 states. [2019-11-19 20:53:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:19,810 INFO L93 Difference]: Finished difference Result 3829 states and 4242 transitions. [2019-11-19 20:53:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-19 20:53:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:19,817 INFO L225 Difference]: With dead ends: 3829 [2019-11-19 20:53:19,818 INFO L226 Difference]: Without dead ends: 1564 [2019-11-19 20:53:19,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2019-11-19 20:53:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1563. [2019-11-19 20:53:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-19 20:53:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1686 transitions. [2019-11-19 20:53:19,846 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1686 transitions. Word has length 194 [2019-11-19 20:53:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:19,847 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 1686 transitions. [2019-11-19 20:53:19,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1686 transitions. [2019-11-19 20:53:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-19 20:53:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:19,852 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:53:19,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 36518128, now seen corresponding path program 1 times [2019-11-19 20:53:19,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:19,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142058294] [2019-11-19 20:53:19,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 20:53:19,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142058294] [2019-11-19 20:53:19,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:19,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:19,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907925726] [2019-11-19 20:53:19,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:19,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:19,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:19,979 INFO L87 Difference]: Start difference. First operand 1563 states and 1686 transitions. Second operand 3 states. [2019-11-19 20:53:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:20,436 INFO L93 Difference]: Finished difference Result 3264 states and 3520 transitions. [2019-11-19 20:53:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:20,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-19 20:53:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:20,438 INFO L225 Difference]: With dead ends: 3264 [2019-11-19 20:53:20,439 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:53:20,442 INFO L630 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-11-19 20:53:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:53:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:53:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:53:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:53:20,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2019-11-19 20:53:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:53:20,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:53:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:53:20,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:53:20,754 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-19 20:53:20,915 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-19 20:53:20,920 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,920 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,920 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,921 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-19 20:53:20,921 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-19 20:53:20,924 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-19 20:53:20,925 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-19 20:53:20,925 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-19 20:53:20,925 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-19 20:53:20,926 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-19 20:53:20,926 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,926 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,926 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,927 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-19 20:53:20,927 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-19 20:53:20,927 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-19 20:53:20,927 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-19 20:53:20,933 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:20,934 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:20,934 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-19 20:53:20,934 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,935 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,935 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,936 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-19 20:53:20,937 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-19 20:53:20,937 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-19 20:53:20,937 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-19 20:53:20,938 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-19 20:53:20,938 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,938 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,941 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,941 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-19 20:53:20,941 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-19 20:53:20,942 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-19 20:53:20,942 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-19 20:53:20,944 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-19 20:53:20,944 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-19 20:53:20,944 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-19 20:53:20,945 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-19 20:53:20,945 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,945 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,945 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,946 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-19 20:53:20,947 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-19 20:53:20,947 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-19 20:53:20,947 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-19 20:53:20,948 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-19 20:53:20,948 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-19 20:53:20,948 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-19 20:53:20,948 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-19 20:53:20,949 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,949 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,949 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,950 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:20,955 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:20,955 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:20,955 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:20,956 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-19 20:53:20,956 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-19 20:53:20,956 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-19 20:53:20,956 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-19 20:53:20,957 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-19 20:53:20,957 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,957 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,957 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,958 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-19 20:53:20,958 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-19 20:53:20,958 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-19 20:53:20,958 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-19 20:53:20,958 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-19 20:53:20,959 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-19 20:53:20,960 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-19 20:53:20,961 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-19 20:53:20,961 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,961 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,961 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,963 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-19 20:53:20,963 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-19 20:53:20,963 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-19 20:53:20,963 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-19 20:53:20,964 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-19 20:53:20,964 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,964 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,964 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,965 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-19 20:53:20,965 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:20,966 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:20,967 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-19 20:53:20,967 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-19 20:53:20,967 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:53:20,967 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2019-11-19 20:53:20,967 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-19 20:53:20,968 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,968 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,968 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-19 20:53:20,968 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-19 20:53:20,968 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-19 20:53:20,969 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-19 20:53:20,969 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-19 20:53:20,969 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-19 20:53:20,969 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:20,969 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:20,970 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-19 20:53:20,970 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse8 (not .cse4)) (.cse1 (= ~a17~0 8)) (.cse9 (= 1 ~a11~0))) (let ((.cse2 (not (= ~a28~0 11))) (.cse0 (not .cse9)) (.cse6 (and .cse8 .cse1)) (.cse3 (= ~a19~0 1)) (.cse5 (= ~a28~0 9)) (.cse7 (= 10 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse5) (and .cse6 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse6) (and .cse3 .cse7) (and .cse5 .cse4) (and .cse8 .cse9 .cse7))))) [2019-11-19 20:53:20,971 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-19 20:53:20,972 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:20,973 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:20,973 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-19 20:53:20,973 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,973 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,974 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-19 20:53:20,974 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-19 20:53:20,974 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-19 20:53:20,974 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-19 20:53:20,974 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-19 20:53:20,975 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-19 20:53:20,975 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:20,975 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:20,976 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-19 20:53:20,976 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,976 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,976 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:20,977 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:20,977 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-19 20:53:20,977 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-19 20:53:20,977 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-19 20:53:20,978 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-19 20:53:20,979 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse8 (not .cse4)) (.cse1 (= ~a17~0 8)) (.cse9 (= 1 ~a11~0))) (let ((.cse2 (not (= ~a28~0 11))) (.cse0 (not .cse9)) (.cse6 (and .cse8 .cse1)) (.cse3 (= ~a19~0 1)) (.cse5 (= ~a28~0 9)) (.cse7 (= 10 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse5) (and .cse6 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse6) (and .cse3 .cse7) (and .cse5 .cse4) (and .cse8 .cse9 .cse7))))) [2019-11-19 20:53:20,979 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,979 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,980 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-19 20:53:20,980 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-19 20:53:20,985 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-19 20:53:20,985 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-19 20:53:20,986 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-19 20:53:20,986 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,986 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,987 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-19 20:53:20,989 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-19 20:53:20,989 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-19 20:53:20,989 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-19 20:53:20,989 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-19 20:53:20,990 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-19 20:53:20,990 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-19 20:53:20,990 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:20,990 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:20,991 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,991 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,991 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-19 20:53:20,992 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,992 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-19 20:53:20,992 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-19 20:53:20,992 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-19 20:53:20,993 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-19 20:53:20,993 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-19 20:53:20,993 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:53:20,993 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-19 20:53:20,994 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,994 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,994 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,995 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-19 20:53:20,995 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-19 20:53:20,995 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-19 20:53:20,995 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-19 20:53:20,996 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-19 20:53:20,996 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,996 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,996 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,996 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-19 20:53:20,997 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-19 20:53:20,997 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-19 20:53:20,997 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-19 20:53:20,997 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-19 20:53:20,998 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-19 20:53:20,998 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,998 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,998 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:20,999 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-19 20:53:20,999 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-19 20:53:20,999 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-19 20:53:20,999 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-19 20:53:21,000 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-19 20:53:21,000 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-19 20:53:21,000 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:53:21,000 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-19 20:53:21,001 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-19 20:53:21,001 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,001 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,001 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,002 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-19 20:53:21,002 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-19 20:53:21,002 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-19 20:53:21,002 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-19 20:53:21,003 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-19 20:53:21,003 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,003 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,003 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:21,004 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-19 20:53:21,004 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-19 20:53:21,004 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-19 20:53:21,004 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-19 20:53:21,004 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-19 20:53:21,005 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-19 20:53:21,005 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:21,005 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-19 20:53:21,005 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:21,005 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-19 20:53:21,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:53:21 BoogieIcfgContainer [2019-11-19 20:53:21,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:53:21,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:53:21,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:53:21,043 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:53:21,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:09" (3/4) ... [2019-11-19 20:53:21,052 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:53:21,094 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:53:21,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:53:21,337 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:53:21,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:53:21,339 INFO L168 Benchmark]: Toolchain (without parser) took 13931.76 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 301.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,339 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:53:21,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.38 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,341 INFO L168 Benchmark]: Boogie Preprocessor took 63.21 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,341 INFO L168 Benchmark]: RCFGBuilder took 1470.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,342 INFO L168 Benchmark]: TraceAbstraction took 11255.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 281.5 MB). Free memory was 997.9 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,342 INFO L168 Benchmark]: Witness Printer took 294.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:21,345 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.38 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.21 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1470.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11255.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 281.5 MB). Free memory was 997.9 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 11.5 GB. * Witness Printer took 294.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a17 == 8) && !(a28 == 11)) || ((!(1 == a11) && a19 == 1) && a25 == 1)) || (!(1 == a11) && a28 == 9)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (!(1 == a11) && !(a25 == 1) && a17 == 8)) || (a19 == 1 && 10 == a28)) || (a28 == 9 && a25 == 1)) || ((!(a25 == 1) && 1 == a11) && 10 == a28) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a17 == 8) && !(a28 == 11)) || ((!(1 == a11) && a19 == 1) && a25 == 1)) || (!(1 == a11) && a28 == 9)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (!(1 == a11) && !(a25 == 1) && a17 == 8)) || (a19 == 1 && 10 == a28)) || (a28 == 9 && a25 == 1)) || ((!(a25 == 1) && 1 == a11) && 10 == a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 11.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 893 SDtfs, 2186 SDslu, 285 SDs, 0 SdLazy, 5734 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2270occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 189 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2041 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 298 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1444 ConstructedInterpolants, 0 QuantifiedInterpolants, 728663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 463/463 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...