./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label01.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer --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 dab50d57c53f23a15c1109c01d840c6793808077 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:20:01,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:20:01,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:20:01,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:20:01,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:20:01,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:20:01,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:20:01,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:20:01,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:20:01,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:20:01,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:20:01,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:20:01,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:20:01,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:20:01,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:20:01,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:20:01,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:20:01,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:20:01,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:20:01,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:20:01,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:20:01,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:20:01,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:20:01,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:20:01,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:20:01,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:20:01,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:20:01,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:20:01,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:20:01,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:20:01,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:20:01,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:20:01,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:20:01,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:20:01,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:20:01,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:20:01,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:20:01,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:20:01,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:20:01,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:20:01,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:20:01,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:20:01,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:20:01,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:20:01,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:20:01,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:20:01,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:20:01,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:20:01,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:20:01,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:20:01,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:20:01,253 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer 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 -> dab50d57c53f23a15c1109c01d840c6793808077 [2019-12-07 10:20:01,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:20:01,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:20:01,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:20:01,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:20:01,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:20:01,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2019-12-07 10:20:01,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/data/58822f54a/6e03939620be4daa867fda0d49875d00/FLAG5c335e87b [2019-12-07 10:20:01,797 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:20:01,797 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2019-12-07 10:20:01,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/data/58822f54a/6e03939620be4daa867fda0d49875d00/FLAG5c335e87b [2019-12-07 10:20:01,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/data/58822f54a/6e03939620be4daa867fda0d49875d00 [2019-12-07 10:20:01,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:20:01,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:20:01,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:20:01,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:20:01,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:20:01,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:20:01" (1/1) ... [2019-12-07 10:20:01,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:01, skipping insertion in model container [2019-12-07 10:20:01,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:20:01" (1/1) ... [2019-12-07 10:20:01,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:20:01,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:20:02,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:20:02,100 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:20:02,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:20:02,163 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:20:02,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02 WrapperNode [2019-12-07 10:20:02,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:20:02,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:20:02,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:20:02,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:20:02,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:20:02,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:20:02,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:20:02,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:20:02,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... [2019-12-07 10:20:02,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:20:02,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:20:02,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:20:02,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:20:02,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/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-12-07 10:20:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:20:02,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:20:02,912 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:20:02,913 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:20:02,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:02 BoogieIcfgContainer [2019-12-07 10:20:02,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:20:02,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:20:02,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:20:02,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:20:02,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:20:01" (1/3) ... [2019-12-07 10:20:02,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17efbb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:20:02, skipping insertion in model container [2019-12-07 10:20:02,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:02" (2/3) ... [2019-12-07 10:20:02,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17efbb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:20:02, skipping insertion in model container [2019-12-07 10:20:02,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:02" (3/3) ... [2019-12-07 10:20:02,920 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label01.c [2019-12-07 10:20:02,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:20:02,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:20:02,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:20:02,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:20:02,967 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:20:02,967 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:20:02,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:20:02,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:20:02,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:20:02,968 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:20:02,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:20:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-12-07 10:20:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 10:20:02,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:02,992 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] [2019-12-07 10:20:02,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1687716446, now seen corresponding path program 1 times [2019-12-07 10:20:03,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:03,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999184843] [2019-12-07 10:20:03,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:20:03,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999184843] [2019-12-07 10:20:03,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:03,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:03,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040745362] [2019-12-07 10:20:03,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:03,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:03,300 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-12-07 10:20:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:04,102 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-12-07 10:20:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:04,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 10:20:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:04,114 INFO L225 Difference]: With dead ends: 662 [2019-12-07 10:20:04,114 INFO L226 Difference]: Without dead ends: 397 [2019-12-07 10:20:04,117 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-12-07 10:20:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-07 10:20:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-12-07 10:20:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-07 10:20:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-12-07 10:20:04,160 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 91 [2019-12-07 10:20:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:04,161 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-12-07 10:20:04,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-12-07 10:20:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 10:20:04,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:04,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:20:04,165 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1583336838, now seen corresponding path program 1 times [2019-12-07 10:20:04,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:04,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202760330] [2019-12-07 10:20:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:20:04,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202760330] [2019-12-07 10:20:04,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:04,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:04,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784912497] [2019-12-07 10:20:04,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:04,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:04,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:04,202 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-12-07 10:20:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:04,543 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-12-07 10:20:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:04,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 10:20:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:04,547 INFO L225 Difference]: With dead ends: 1185 [2019-12-07 10:20:04,547 INFO L226 Difference]: Without dead ends: 790 [2019-12-07 10:20:04,549 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-12-07 10:20:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-12-07 10:20:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-12-07 10:20:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 10:20:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-12-07 10:20:04,575 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 96 [2019-12-07 10:20:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:04,575 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-12-07 10:20:04,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-12-07 10:20:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 10:20:04,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:04,578 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 10:20:04,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1473567844, now seen corresponding path program 1 times [2019-12-07 10:20:04,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:04,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037147433] [2019-12-07 10:20:04,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:20:04,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037147433] [2019-12-07 10:20:04,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:04,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:04,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493653737] [2019-12-07 10:20:04,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:04,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:04,626 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-12-07 10:20:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:04,919 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-12-07 10:20:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:04,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-12-07 10:20:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:04,926 INFO L225 Difference]: With dead ends: 1971 [2019-12-07 10:20:04,926 INFO L226 Difference]: Without dead ends: 1183 [2019-12-07 10:20:04,928 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-12-07 10:20:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-07 10:20:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-12-07 10:20:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-12-07 10:20:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-12-07 10:20:04,955 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 117 [2019-12-07 10:20:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:04,956 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-12-07 10:20:04,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-12-07 10:20:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 10:20:04,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:04,959 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:20:04,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1222693529, now seen corresponding path program 1 times [2019-12-07 10:20:04,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:04,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269685669] [2019-12-07 10:20:04,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 10:20:05,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269685669] [2019-12-07 10:20:05,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:05,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:05,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887467040] [2019-12-07 10:20:05,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:05,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:05,025 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-12-07 10:20:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:05,345 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-12-07 10:20:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:05,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-12-07 10:20:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:05,351 INFO L225 Difference]: With dead ends: 2233 [2019-12-07 10:20:05,351 INFO L226 Difference]: Without dead ends: 1314 [2019-12-07 10:20:05,352 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-12-07 10:20:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-12-07 10:20:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-12-07 10:20:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-12-07 10:20:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-12-07 10:20:05,371 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 153 [2019-12-07 10:20:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:05,372 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-12-07 10:20:05,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-12-07 10:20:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 10:20:05,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:05,374 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 10:20:05,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash 160905897, now seen corresponding path program 1 times [2019-12-07 10:20:05,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:05,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475654454] [2019-12-07 10:20:05,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-12-07 10:20:05,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475654454] [2019-12-07 10:20:05,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:05,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:05,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405619222] [2019-12-07 10:20:05,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:05,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:05,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:05,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:05,427 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-12-07 10:20:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:05,782 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-12-07 10:20:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:05,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 10:20:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:05,792 INFO L225 Difference]: With dead ends: 3150 [2019-12-07 10:20:05,792 INFO L226 Difference]: Without dead ends: 1969 [2019-12-07 10:20:05,794 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-12-07 10:20:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-12-07 10:20:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-12-07 10:20:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-12-07 10:20:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2134 transitions. [2019-12-07 10:20:05,833 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2134 transitions. Word has length 172 [2019-12-07 10:20:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:05,833 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2134 transitions. [2019-12-07 10:20:05,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2134 transitions. [2019-12-07 10:20:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 10:20:05,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:05,837 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:05,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -645359518, now seen corresponding path program 1 times [2019-12-07 10:20:05,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:05,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44983600] [2019-12-07 10:20:05,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 10:20:05,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44983600] [2019-12-07 10:20:05,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:05,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:05,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213173321] [2019-12-07 10:20:05,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:05,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:05,892 INFO L87 Difference]: Start difference. First operand 1707 states and 2134 transitions. Second operand 3 states. [2019-12-07 10:20:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:06,200 INFO L93 Difference]: Finished difference Result 3674 states and 4582 transitions. [2019-12-07 10:20:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:06,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-12-07 10:20:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:06,207 INFO L225 Difference]: With dead ends: 3674 [2019-12-07 10:20:06,207 INFO L226 Difference]: Without dead ends: 1969 [2019-12-07 10:20:06,208 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-12-07 10:20:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-12-07 10:20:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-12-07 10:20:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-12-07 10:20:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2408 transitions. [2019-12-07 10:20:06,238 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2408 transitions. Word has length 175 [2019-12-07 10:20:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:06,238 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2408 transitions. [2019-12-07 10:20:06,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2408 transitions. [2019-12-07 10:20:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 10:20:06,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:06,242 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:06,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1056675030, now seen corresponding path program 1 times [2019-12-07 10:20:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:06,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62246199] [2019-12-07 10:20:06,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 10:20:06,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62246199] [2019-12-07 10:20:06,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:06,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:20:06,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585028563] [2019-12-07 10:20:06,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:20:06,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:20:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:20:06,367 INFO L87 Difference]: Start difference. First operand 1969 states and 2408 transitions. Second operand 8 states. [2019-12-07 10:20:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:07,083 INFO L93 Difference]: Finished difference Result 4106 states and 4990 transitions. [2019-12-07 10:20:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:20:07,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-12-07 10:20:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:07,090 INFO L225 Difference]: With dead ends: 4106 [2019-12-07 10:20:07,090 INFO L226 Difference]: Without dead ends: 2139 [2019-12-07 10:20:07,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:20:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-12-07 10:20:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1969. [2019-12-07 10:20:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-12-07 10:20:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2019-12-07 10:20:07,117 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 179 [2019-12-07 10:20:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:07,117 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2019-12-07 10:20:07,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:20:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2019-12-07 10:20:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 10:20:07,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:07,121 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:07,121 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:07,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash 916250074, now seen corresponding path program 1 times [2019-12-07 10:20:07,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:07,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157579769] [2019-12-07 10:20:07,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 10:20:07,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157579769] [2019-12-07 10:20:07,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:07,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:20:07,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580885892] [2019-12-07 10:20:07,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:07,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:07,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:07,208 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand 4 states. [2019-12-07 10:20:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:07,661 INFO L93 Difference]: Finished difference Result 4198 states and 5112 transitions. [2019-12-07 10:20:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:07,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-12-07 10:20:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:07,668 INFO L225 Difference]: With dead ends: 4198 [2019-12-07 10:20:07,668 INFO L226 Difference]: Without dead ends: 2231 [2019-12-07 10:20:07,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-07 10:20:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2019-12-07 10:20:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-07 10:20:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2461 transitions. [2019-12-07 10:20:07,705 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2461 transitions. Word has length 212 [2019-12-07 10:20:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:07,705 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2461 transitions. [2019-12-07 10:20:07,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2461 transitions. [2019-12-07 10:20:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-07 10:20:07,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:07,710 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 10:20:07,710 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1317230938, now seen corresponding path program 1 times [2019-12-07 10:20:07,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:07,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389737000] [2019-12-07 10:20:07,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 10:20:07,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389737000] [2019-12-07 10:20:07,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:07,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:20:07,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334628197] [2019-12-07 10:20:07,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:07,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:07,845 INFO L87 Difference]: Start difference. First operand 2100 states and 2461 transitions. Second operand 4 states. [2019-12-07 10:20:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:08,261 INFO L93 Difference]: Finished difference Result 4722 states and 5498 transitions. [2019-12-07 10:20:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:08,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-12-07 10:20:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:08,273 INFO L225 Difference]: With dead ends: 4722 [2019-12-07 10:20:08,273 INFO L226 Difference]: Without dead ends: 2624 [2019-12-07 10:20:08,275 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-12-07 10:20:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-12-07 10:20:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-12-07 10:20:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-12-07 10:20:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-12-07 10:20:08,306 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 238 [2019-12-07 10:20:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:08,307 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-12-07 10:20:08,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-12-07 10:20:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-12-07 10:20:08,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:08,311 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:08,311 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash 503715675, now seen corresponding path program 1 times [2019-12-07 10:20:08,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:08,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372990214] [2019-12-07 10:20:08,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 10:20:08,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372990214] [2019-12-07 10:20:08,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:08,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:20:08,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220295191] [2019-12-07 10:20:08,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:20:08,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:20:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:20:08,430 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-12-07 10:20:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:08,939 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-12-07 10:20:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:08,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-12-07 10:20:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:08,946 INFO L225 Difference]: With dead ends: 4105 [2019-12-07 10:20:08,946 INFO L226 Difference]: Without dead ends: 2138 [2019-12-07 10:20:08,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:20:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-12-07 10:20:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-12-07 10:20:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-12-07 10:20:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-12-07 10:20:08,966 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 259 [2019-12-07 10:20:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:08,967 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-12-07 10:20:08,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:20:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-12-07 10:20:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 10:20:08,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:08,970 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:08,970 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash 221877156, now seen corresponding path program 1 times [2019-12-07 10:20:08,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:08,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551237179] [2019-12-07 10:20:08,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-12-07 10:20:09,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551237179] [2019-12-07 10:20:09,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835466178] [2019-12-07 10:20:09,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:20:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:09,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:20:09,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:20:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-12-07 10:20:09,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:20:09,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-12-07 10:20:09,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164918208] [2019-12-07 10:20:09,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:09,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:09,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:20:09,915 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-12-07 10:20:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:10,266 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-12-07 10:20:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:10,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-12-07 10:20:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:10,267 INFO L225 Difference]: With dead ends: 3672 [2019-12-07 10:20:10,267 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:20:10,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:20:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:20:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:20:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:20:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:20:10,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-12-07 10:20:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:20:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:20:10,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:20:10,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:20:10,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:20:10,577 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-12-07 10:20:10,960 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-12-07 10:20:11,267 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,269 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,270 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 10:20:11,271 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-12-07 10:20:11,272 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-12-07 10:20:11,273 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,274 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,275 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 10:20:11,276 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,277 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 10:20:11,278 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-12-07 10:20:11,279 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-12-07 10:20:11,280 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,281 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 10:20:11,282 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 10:20:11,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:20:11 BoogieIcfgContainer [2019-12-07 10:20:11,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:20:11,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:20:11,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:20:11,298 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:20:11,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:02" (3/4) ... [2019-12-07 10:20:11,301 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:20:11,315 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:20:11,316 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:20:11,402 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c9fe2c8b-6b9c-4a96-92ec-9cca694861f3/bin/uautomizer/witness.graphml [2019-12-07 10:20:11,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:20:11,403 INFO L168 Benchmark]: Toolchain (without parser) took 9584.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -69.8 MB). Peak memory consumption was 264.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,403 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:20:11,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,404 INFO L168 Benchmark]: Boogie Preprocessor took 38.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,404 INFO L168 Benchmark]: RCFGBuilder took 660.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,405 INFO L168 Benchmark]: TraceAbstraction took 8383.02 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -95.3 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,405 INFO L168 Benchmark]: Witness Printer took 104.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:11,407 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 660.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8383.02 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -95.3 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. * Witness Printer took 104.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 7.5s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 951 SDtfs, 2137 SDslu, 120 SDs, 0 SdLazy, 5988 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1911 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 225 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6228 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4081 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623912 SizeOfPredicates, 1 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...