./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:30:18,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:30:18,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:30:18,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:30:18,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:30:18,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:30:18,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:30:18,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:30:18,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:30:19,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:30:19,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:30:19,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:30:19,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:30:19,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:30:19,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:30:19,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:30:19,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:30:19,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:30:19,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:30:19,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:30:19,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:30:19,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:30:19,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:30:19,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:30:19,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:30:19,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:30:19,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:30:19,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:30:19,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:30:19,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:30:19,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:30:19,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:30:19,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:30:19,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:30:19,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:30:19,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:30:19,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:30:19,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:30:19,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:30:19,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:30:19,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:30:19,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:30:19,115 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:30:19,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:30:19,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:30:19,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:30:19,119 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:30:19,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:30:19,119 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:30:19,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:30:19,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:30:19,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:30:19,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:30:19,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:30:19,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:30:19,123 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:30:19,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:30:19,123 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:30:19,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:30:19,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:30:19,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:30:19,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:30:19,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:30:19,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:30:19,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:30:19,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:30:19,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:30:19,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:30:19,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:30:19,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:30:19,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:30:19,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_4c5858f9-8683-4500-ada5-a81705c5e871/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(reach_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 -> 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f [2020-12-01 15:30:19,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:30:19,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:30:19,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:30:19,541 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:30:19,542 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:30:19,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2020-12-01 15:30:19,650 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/data/fcff778f7/e3df3af88ce4409b9ea31c20716bdcb1/FLAG57bbae6dd [2020-12-01 15:30:20,384 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:30:20,384 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/sv-benchmarks/c/loop-invgen/heapsort.i [2020-12-01 15:30:20,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/data/fcff778f7/e3df3af88ce4409b9ea31c20716bdcb1/FLAG57bbae6dd [2020-12-01 15:30:20,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/data/fcff778f7/e3df3af88ce4409b9ea31c20716bdcb1 [2020-12-01 15:30:20,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:30:20,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:30:20,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:30:20,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:30:20,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:30:20,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:30:20" (1/1) ... [2020-12-01 15:30:20,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd7e6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:20, skipping insertion in model container [2020-12-01 15:30:20,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:30:20" (1/1) ... [2020-12-01 15:30:20,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:30:20,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:30:21,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:30:21,025 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:30:21,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:30:21,071 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:30:21,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21 WrapperNode [2020-12-01 15:30:21,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:30:21,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:30:21,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:30:21,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:30:21,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:30:21,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:30:21,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:30:21,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:30:21,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... [2020-12-01 15:30:21,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:30:21,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:30:21,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:30:21,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:30:21,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/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 [2020-12-01 15:30:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:30:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:30:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:30:21,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:30:22,022 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:30:22,023 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-12-01 15:30:22,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:30:22 BoogieIcfgContainer [2020-12-01 15:30:22,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:30:22,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:30:22,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:30:22,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:30:22,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:30:20" (1/3) ... [2020-12-01 15:30:22,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52797ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:30:22, skipping insertion in model container [2020-12-01 15:30:22,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:30:21" (2/3) ... [2020-12-01 15:30:22,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52797ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:30:22, skipping insertion in model container [2020-12-01 15:30:22,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:30:22" (3/3) ... [2020-12-01 15:30:22,042 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2020-12-01 15:30:22,064 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:30:22,068 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-12-01 15:30:22,083 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-12-01 15:30:22,124 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:30:22,124 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:30:22,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:30:22,125 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:30:22,125 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:30:22,125 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:30:22,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:30:22,126 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:30:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2020-12-01 15:30:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:30:22,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:22,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:22,172 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 188725206, now seen corresponding path program 1 times [2020-12-01 15:30:22,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:22,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512756764] [2020-12-01 15:30:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:22,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512756764] [2020-12-01 15:30:22,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:22,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:30:22,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397527583] [2020-12-01 15:30:22,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-01 15:30:22,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-01 15:30:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:30:22,426 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2020-12-01 15:30:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:22,460 INFO L93 Difference]: Finished difference Result 208 states and 280 transitions. [2020-12-01 15:30:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-01 15:30:22,462 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-01 15:30:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:22,476 INFO L225 Difference]: With dead ends: 208 [2020-12-01 15:30:22,476 INFO L226 Difference]: Without dead ends: 95 [2020-12-01 15:30:22,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:30:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-01 15:30:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-12-01 15:30:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-01 15:30:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2020-12-01 15:30:22,566 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 11 [2020-12-01 15:30:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:22,567 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2020-12-01 15:30:22,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-01 15:30:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2020-12-01 15:30:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:30:22,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:22,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:22,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:30:22,570 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1585687510, now seen corresponding path program 1 times [2020-12-01 15:30:22,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:22,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440739594] [2020-12-01 15:30:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:22,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440739594] [2020-12-01 15:30:22,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:22,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:30:22,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101496529] [2020-12-01 15:30:22,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:30:22,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:30:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:30:22,672 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 3 states. [2020-12-01 15:30:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:22,823 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2020-12-01 15:30:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:30:22,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-01 15:30:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:22,827 INFO L225 Difference]: With dead ends: 100 [2020-12-01 15:30:22,827 INFO L226 Difference]: Without dead ends: 96 [2020-12-01 15:30:22,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:30:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-01 15:30:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-12-01 15:30:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-01 15:30:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-12-01 15:30:22,842 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 11 [2020-12-01 15:30:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:22,843 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-12-01 15:30:22,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:30:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-12-01 15:30:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:30:22,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:22,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:22,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:30:22,845 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1547515310, now seen corresponding path program 1 times [2020-12-01 15:30:22,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:22,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911451579] [2020-12-01 15:30:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:22,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911451579] [2020-12-01 15:30:22,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:22,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:30:22,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798068617] [2020-12-01 15:30:22,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:30:22,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:22,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:30:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:30:22,996 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 4 states. [2020-12-01 15:30:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:23,236 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2020-12-01 15:30:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:30:23,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-01 15:30:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:23,238 INFO L225 Difference]: With dead ends: 98 [2020-12-01 15:30:23,238 INFO L226 Difference]: Without dead ends: 94 [2020-12-01 15:30:23,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-01 15:30:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2020-12-01 15:30:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-01 15:30:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2020-12-01 15:30:23,251 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 11 [2020-12-01 15:30:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:23,252 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2020-12-01 15:30:23,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:30:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2020-12-01 15:30:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:30:23,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:23,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:23,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:30:23,254 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1729787563, now seen corresponding path program 1 times [2020-12-01 15:30:23,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:23,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042602419] [2020-12-01 15:30:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:23,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042602419] [2020-12-01 15:30:23,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:23,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:30:23,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279236229] [2020-12-01 15:30:23,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:30:23,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:30:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:23,328 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 5 states. [2020-12-01 15:30:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:23,876 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2020-12-01 15:30:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:23,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-01 15:30:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:23,881 INFO L225 Difference]: With dead ends: 176 [2020-12-01 15:30:23,881 INFO L226 Difference]: Without dead ends: 160 [2020-12-01 15:30:23,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:30:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-01 15:30:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 118. [2020-12-01 15:30:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-01 15:30:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2020-12-01 15:30:23,910 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 11 [2020-12-01 15:30:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:23,911 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2020-12-01 15:30:23,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:30:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2020-12-01 15:30:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:30:23,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:23,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:23,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:30:23,913 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:23,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1253179949, now seen corresponding path program 1 times [2020-12-01 15:30:23,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:23,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722459000] [2020-12-01 15:30:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:24,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722459000] [2020-12-01 15:30:24,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:24,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:24,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034514281] [2020-12-01 15:30:24,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:24,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:24,014 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 6 states. [2020-12-01 15:30:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:24,479 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2020-12-01 15:30:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:24,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-01 15:30:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:24,484 INFO L225 Difference]: With dead ends: 196 [2020-12-01 15:30:24,485 INFO L226 Difference]: Without dead ends: 192 [2020-12-01 15:30:24,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:30:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-01 15:30:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 152. [2020-12-01 15:30:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-12-01 15:30:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2020-12-01 15:30:24,521 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 13 [2020-12-01 15:30:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:24,521 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2020-12-01 15:30:24,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2020-12-01 15:30:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:30:24,523 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:24,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:24,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:30:24,524 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -718040235, now seen corresponding path program 1 times [2020-12-01 15:30:24,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:24,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586666787] [2020-12-01 15:30:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:24,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586666787] [2020-12-01 15:30:24,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:24,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:30:24,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344594651] [2020-12-01 15:30:24,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:30:24,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:30:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:30:24,623 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand 4 states. [2020-12-01 15:30:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:24,803 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2020-12-01 15:30:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:30:24,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-01 15:30:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:24,805 INFO L225 Difference]: With dead ends: 162 [2020-12-01 15:30:24,806 INFO L226 Difference]: Without dead ends: 158 [2020-12-01 15:30:24,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-01 15:30:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-12-01 15:30:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-01 15:30:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2020-12-01 15:30:24,849 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 13 [2020-12-01 15:30:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:24,851 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2020-12-01 15:30:24,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:30:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2020-12-01 15:30:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:30:24,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:24,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:24,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:30:24,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 211975736, now seen corresponding path program 1 times [2020-12-01 15:30:24,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:24,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431707419] [2020-12-01 15:30:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:24,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431707419] [2020-12-01 15:30:24,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:24,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:24,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699888] [2020-12-01 15:30:24,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:24,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:24,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:24,952 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand 6 states. [2020-12-01 15:30:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:25,366 INFO L93 Difference]: Finished difference Result 289 states and 333 transitions. [2020-12-01 15:30:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:25,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-01 15:30:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:25,369 INFO L225 Difference]: With dead ends: 289 [2020-12-01 15:30:25,369 INFO L226 Difference]: Without dead ends: 277 [2020-12-01 15:30:25,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:30:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-12-01 15:30:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 196. [2020-12-01 15:30:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-12-01 15:30:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2020-12-01 15:30:25,402 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 13 [2020-12-01 15:30:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:25,403 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2020-12-01 15:30:25,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2020-12-01 15:30:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:30:25,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:25,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:25,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:30:25,411 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash 860152939, now seen corresponding path program 1 times [2020-12-01 15:30:25,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:25,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284966940] [2020-12-01 15:30:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:25,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284966940] [2020-12-01 15:30:25,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:25,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:30:25,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770830684] [2020-12-01 15:30:25,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:30:25,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:30:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:30:25,464 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand 3 states. [2020-12-01 15:30:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:25,527 INFO L93 Difference]: Finished difference Result 437 states and 533 transitions. [2020-12-01 15:30:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:30:25,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-01 15:30:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:25,531 INFO L225 Difference]: With dead ends: 437 [2020-12-01 15:30:25,531 INFO L226 Difference]: Without dead ends: 331 [2020-12-01 15:30:25,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:30:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-12-01 15:30:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2020-12-01 15:30:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-01 15:30:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 378 transitions. [2020-12-01 15:30:25,565 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 378 transitions. Word has length 13 [2020-12-01 15:30:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:25,566 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 378 transitions. [2020-12-01 15:30:25,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:30:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 378 transitions. [2020-12-01 15:30:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:30:25,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:25,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:25,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:30:25,569 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash -181051274, now seen corresponding path program 1 times [2020-12-01 15:30:25,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:25,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118426958] [2020-12-01 15:30:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:25,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118426958] [2020-12-01 15:30:25,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:25,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:30:25,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877785669] [2020-12-01 15:30:25,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:30:25,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:30:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:30:25,662 INFO L87 Difference]: Start difference. First operand 291 states and 378 transitions. Second operand 4 states. [2020-12-01 15:30:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:25,746 INFO L93 Difference]: Finished difference Result 316 states and 397 transitions. [2020-12-01 15:30:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:30:25,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-01 15:30:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:25,750 INFO L225 Difference]: With dead ends: 316 [2020-12-01 15:30:25,750 INFO L226 Difference]: Without dead ends: 260 [2020-12-01 15:30:25,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-12-01 15:30:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2020-12-01 15:30:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-01 15:30:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 336 transitions. [2020-12-01 15:30:25,782 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 336 transitions. Word has length 13 [2020-12-01 15:30:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:25,783 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 336 transitions. [2020-12-01 15:30:25,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:30:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 336 transitions. [2020-12-01 15:30:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:30:25,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:25,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:25,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:30:25,787 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 899711198, now seen corresponding path program 1 times [2020-12-01 15:30:25,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:25,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608066094] [2020-12-01 15:30:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:25,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608066094] [2020-12-01 15:30:25,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:25,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:30:25,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046249844] [2020-12-01 15:30:25,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:30:25,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:30:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:25,898 INFO L87 Difference]: Start difference. First operand 260 states and 336 transitions. Second operand 5 states. [2020-12-01 15:30:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:26,154 INFO L93 Difference]: Finished difference Result 412 states and 525 transitions. [2020-12-01 15:30:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:30:26,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-01 15:30:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:26,171 INFO L225 Difference]: With dead ends: 412 [2020-12-01 15:30:26,171 INFO L226 Difference]: Without dead ends: 396 [2020-12-01 15:30:26,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:30:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2020-12-01 15:30:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 216. [2020-12-01 15:30:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-01 15:30:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2020-12-01 15:30:26,207 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 17 [2020-12-01 15:30:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:26,207 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2020-12-01 15:30:26,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:30:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2020-12-01 15:30:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:30:26,209 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:26,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:26,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:30:26,210 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash -122472242, now seen corresponding path program 1 times [2020-12-01 15:30:26,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:26,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869432111] [2020-12-01 15:30:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:26,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869432111] [2020-12-01 15:30:26,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:26,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:30:26,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732189309] [2020-12-01 15:30:26,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:30:26,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:26,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:30:26,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:26,293 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand 5 states. [2020-12-01 15:30:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:26,540 INFO L93 Difference]: Finished difference Result 334 states and 404 transitions. [2020-12-01 15:30:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:26,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-01 15:30:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:26,545 INFO L225 Difference]: With dead ends: 334 [2020-12-01 15:30:26,545 INFO L226 Difference]: Without dead ends: 330 [2020-12-01 15:30:26,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:30:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-01 15:30:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 262. [2020-12-01 15:30:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-01 15:30:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 328 transitions. [2020-12-01 15:30:26,574 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 328 transitions. Word has length 17 [2020-12-01 15:30:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:26,575 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 328 transitions. [2020-12-01 15:30:26,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:30:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 328 transitions. [2020-12-01 15:30:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:30:26,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:26,576 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:26,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:30:26,577 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash -810248530, now seen corresponding path program 1 times [2020-12-01 15:30:26,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:26,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123697817] [2020-12-01 15:30:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:26,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123697817] [2020-12-01 15:30:26,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:26,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:30:26,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032224546] [2020-12-01 15:30:26,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:30:26,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:30:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:30:26,664 INFO L87 Difference]: Start difference. First operand 262 states and 328 transitions. Second operand 5 states. [2020-12-01 15:30:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:26,882 INFO L93 Difference]: Finished difference Result 834 states and 989 transitions. [2020-12-01 15:30:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:30:26,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-01 15:30:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:26,887 INFO L225 Difference]: With dead ends: 834 [2020-12-01 15:30:26,887 INFO L226 Difference]: Without dead ends: 640 [2020-12-01 15:30:26,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:30:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-12-01 15:30:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 262. [2020-12-01 15:30:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-01 15:30:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 326 transitions. [2020-12-01 15:30:26,926 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 326 transitions. Word has length 18 [2020-12-01 15:30:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:26,928 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 326 transitions. [2020-12-01 15:30:26,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:30:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 326 transitions. [2020-12-01 15:30:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:30:26,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:26,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:26,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:30:26,929 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:26,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1346223215, now seen corresponding path program 1 times [2020-12-01 15:30:26,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:26,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294569904] [2020-12-01 15:30:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:27,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294569904] [2020-12-01 15:30:27,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:27,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:27,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833022220] [2020-12-01 15:30:27,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:27,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:27,019 INFO L87 Difference]: Start difference. First operand 262 states and 326 transitions. Second operand 6 states. [2020-12-01 15:30:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:27,291 INFO L93 Difference]: Finished difference Result 412 states and 506 transitions. [2020-12-01 15:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:30:27,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-01 15:30:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:27,295 INFO L225 Difference]: With dead ends: 412 [2020-12-01 15:30:27,295 INFO L226 Difference]: Without dead ends: 408 [2020-12-01 15:30:27,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:30:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-12-01 15:30:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 324. [2020-12-01 15:30:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-01 15:30:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 408 transitions. [2020-12-01 15:30:27,330 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 408 transitions. Word has length 19 [2020-12-01 15:30:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:27,330 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 408 transitions. [2020-12-01 15:30:27,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 408 transitions. [2020-12-01 15:30:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 15:30:27,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:27,334 INFO L422 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] [2020-12-01 15:30:27,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:30:27,334 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2091375861, now seen corresponding path program 1 times [2020-12-01 15:30:27,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:27,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112271788] [2020-12-01 15:30:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:27,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112271788] [2020-12-01 15:30:27,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:27,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:27,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333425723] [2020-12-01 15:30:27,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:27,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:27,431 INFO L87 Difference]: Start difference. First operand 324 states and 408 transitions. Second operand 6 states. [2020-12-01 15:30:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:27,718 INFO L93 Difference]: Finished difference Result 434 states and 528 transitions. [2020-12-01 15:30:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:27,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-01 15:30:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:27,723 INFO L225 Difference]: With dead ends: 434 [2020-12-01 15:30:27,723 INFO L226 Difference]: Without dead ends: 426 [2020-12-01 15:30:27,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:30:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-01 15:30:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 228. [2020-12-01 15:30:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-12-01 15:30:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 278 transitions. [2020-12-01 15:30:27,765 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 278 transitions. Word has length 23 [2020-12-01 15:30:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:27,767 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 278 transitions. [2020-12-01 15:30:27,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 278 transitions. [2020-12-01 15:30:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 15:30:27,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:27,768 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:27,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:30:27,769 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1419753398, now seen corresponding path program 1 times [2020-12-01 15:30:27,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:27,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939792489] [2020-12-01 15:30:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:27,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939792489] [2020-12-01 15:30:27,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:27,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:27,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120344758] [2020-12-01 15:30:27,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:27,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:27,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:27,846 INFO L87 Difference]: Start difference. First operand 228 states and 278 transitions. Second operand 6 states. [2020-12-01 15:30:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:28,031 INFO L93 Difference]: Finished difference Result 229 states and 279 transitions. [2020-12-01 15:30:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:30:28,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-12-01 15:30:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:28,033 INFO L225 Difference]: With dead ends: 229 [2020-12-01 15:30:28,033 INFO L226 Difference]: Without dead ends: 213 [2020-12-01 15:30:28,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:30:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-01 15:30:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2020-12-01 15:30:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-01 15:30:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2020-12-01 15:30:28,063 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 25 [2020-12-01 15:30:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:28,063 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2020-12-01 15:30:28,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2020-12-01 15:30:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-01 15:30:28,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:28,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:28,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:30:28,069 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1207839747, now seen corresponding path program 1 times [2020-12-01 15:30:28,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:28,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909492235] [2020-12-01 15:30:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:28,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909492235] [2020-12-01 15:30:28,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:30:28,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:30:28,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53867915] [2020-12-01 15:30:28,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:28,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:30:28,155 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 6 states. [2020-12-01 15:30:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:28,380 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2020-12-01 15:30:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:30:28,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-01 15:30:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:28,385 INFO L225 Difference]: With dead ends: 256 [2020-12-01 15:30:28,386 INFO L226 Difference]: Without dead ends: 252 [2020-12-01 15:30:28,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:30:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-12-01 15:30:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 114. [2020-12-01 15:30:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-01 15:30:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2020-12-01 15:30:28,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 31 [2020-12-01 15:30:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:28,407 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2020-12-01 15:30:28,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2020-12-01 15:30:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 15:30:28,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:28,408 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-01 15:30:28,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:30:28,408 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash -647357354, now seen corresponding path program 1 times [2020-12-01 15:30:28,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:28,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548675609] [2020-12-01 15:30:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:28,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548675609] [2020-12-01 15:30:28,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799376050] [2020-12-01 15:30:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/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 [2020-12-01 15:30:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:28,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-01 15:30:28,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:28,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:30:28,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2020-12-01 15:30:28,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610290337] [2020-12-01 15:30:28,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:28,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:30:28,995 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 6 states. [2020-12-01 15:30:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:29,289 INFO L93 Difference]: Finished difference Result 415 states and 479 transitions. [2020-12-01 15:30:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:30:29,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-12-01 15:30:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:29,292 INFO L225 Difference]: With dead ends: 415 [2020-12-01 15:30:29,292 INFO L226 Difference]: Without dead ends: 305 [2020-12-01 15:30:29,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:30:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-01 15:30:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2020-12-01 15:30:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-01 15:30:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 306 transitions. [2020-12-01 15:30:29,362 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 306 transitions. Word has length 33 [2020-12-01 15:30:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:29,363 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 306 transitions. [2020-12-01 15:30:29,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 306 transitions. [2020-12-01 15:30:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 15:30:29,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:29,364 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-01 15:30:29,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-01 15:30:29,579 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash 10877698, now seen corresponding path program 1 times [2020-12-01 15:30:29,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:29,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326925171] [2020-12-01 15:30:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:29,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326925171] [2020-12-01 15:30:29,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374603038] [2020-12-01 15:30:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:29,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-01 15:30:29,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:30,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:30:30,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2020-12-01 15:30:30,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548921184] [2020-12-01 15:30:30,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:30:30,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:30:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:30:30,226 INFO L87 Difference]: Start difference. First operand 260 states and 306 transitions. Second operand 7 states. [2020-12-01 15:30:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:30,679 INFO L93 Difference]: Finished difference Result 529 states and 613 transitions. [2020-12-01 15:30:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:30:30,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-12-01 15:30:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:30,684 INFO L225 Difference]: With dead ends: 529 [2020-12-01 15:30:30,684 INFO L226 Difference]: Without dead ends: 303 [2020-12-01 15:30:30,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:30:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-01 15:30:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 224. [2020-12-01 15:30:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-12-01 15:30:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2020-12-01 15:30:30,732 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 42 [2020-12-01 15:30:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:30,733 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2020-12-01 15:30:30,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:30:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2020-12-01 15:30:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 15:30:30,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:30,734 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-01 15:30:30,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-01 15:30:30,951 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1934105732, now seen corresponding path program 1 times [2020-12-01 15:30:30,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:30,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508954737] [2020-12-01 15:30:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:31,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508954737] [2020-12-01 15:30:31,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186135460] [2020-12-01 15:30:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:31,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-01 15:30:31,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:31,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:30:31,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-12-01 15:30:31,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532522069] [2020-12-01 15:30:31,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:30:31,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:30:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:30:31,435 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand 6 states. [2020-12-01 15:30:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:31,728 INFO L93 Difference]: Finished difference Result 405 states and 467 transitions. [2020-12-01 15:30:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:30:31,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-12-01 15:30:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:31,730 INFO L225 Difference]: With dead ends: 405 [2020-12-01 15:30:31,731 INFO L226 Difference]: Without dead ends: 168 [2020-12-01 15:30:31,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:30:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-01 15:30:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2020-12-01 15:30:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-01 15:30:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2020-12-01 15:30:31,757 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 42 [2020-12-01 15:30:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:31,759 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2020-12-01 15:30:31,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:30:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2020-12-01 15:30:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-01 15:30:31,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:31,761 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-01 15:30:31,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:31,975 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1167721867, now seen corresponding path program 1 times [2020-12-01 15:30:31,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:31,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080954472] [2020-12-01 15:30:31,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-01 15:30:32,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080954472] [2020-12-01 15:30:32,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574708521] [2020-12-01 15:30:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:32,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-01 15:30:32,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-01 15:30:32,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:32,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-12-01 15:30:32,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487936532] [2020-12-01 15:30:32,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:30:32,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:32,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:30:32,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:30:32,288 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 9 states. [2020-12-01 15:30:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:33,240 INFO L93 Difference]: Finished difference Result 436 states and 485 transitions. [2020-12-01 15:30:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:30:33,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2020-12-01 15:30:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:33,244 INFO L225 Difference]: With dead ends: 436 [2020-12-01 15:30:33,244 INFO L226 Difference]: Without dead ends: 326 [2020-12-01 15:30:33,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2020-12-01 15:30:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-12-01 15:30:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 181. [2020-12-01 15:30:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-01 15:30:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2020-12-01 15:30:33,282 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 47 [2020-12-01 15:30:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:33,282 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2020-12-01 15:30:33,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:30:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2020-12-01 15:30:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-01 15:30:33,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:33,284 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-01 15:30:33,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:33,525 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1149279597, now seen corresponding path program 1 times [2020-12-01 15:30:33,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:33,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952769705] [2020-12-01 15:30:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:33,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952769705] [2020-12-01 15:30:33,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953913892] [2020-12-01 15:30:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:33,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-01 15:30:33,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:34,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:34,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2020-12-01 15:30:34,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70780989] [2020-12-01 15:30:34,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:30:34,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:30:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:30:34,062 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 15 states. [2020-12-01 15:30:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:41,902 INFO L93 Difference]: Finished difference Result 1230 states and 1369 transitions. [2020-12-01 15:30:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2020-12-01 15:30:41,902 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-12-01 15:30:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:41,909 INFO L225 Difference]: With dead ends: 1230 [2020-12-01 15:30:41,909 INFO L226 Difference]: Without dead ends: 1041 [2020-12-01 15:30:41,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6174 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1946, Invalid=13306, Unknown=0, NotChecked=0, Total=15252 [2020-12-01 15:30:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2020-12-01 15:30:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 386. [2020-12-01 15:30:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-12-01 15:30:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 436 transitions. [2020-12-01 15:30:42,027 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 436 transitions. Word has length 56 [2020-12-01 15:30:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:42,028 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 436 transitions. [2020-12-01 15:30:42,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:30:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 436 transitions. [2020-12-01 15:30:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-01 15:30:42,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:42,030 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:42,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-01 15:30:42,247 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1872181902, now seen corresponding path program 1 times [2020-12-01 15:30:42,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:42,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910312704] [2020-12-01 15:30:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:42,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910312704] [2020-12-01 15:30:42,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450595876] [2020-12-01 15:30:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:42,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-01 15:30:42,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:42,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:30:42,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:30:42,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:30:42,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:30:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:42,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:42,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-12-01 15:30:42,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638244690] [2020-12-01 15:30:42,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:30:42,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:30:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:30:42,701 INFO L87 Difference]: Start difference. First operand 386 states and 436 transitions. Second operand 13 states. [2020-12-01 15:30:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:44,348 INFO L93 Difference]: Finished difference Result 683 states and 762 transitions. [2020-12-01 15:30:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-01 15:30:44,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2020-12-01 15:30:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:44,355 INFO L225 Difference]: With dead ends: 683 [2020-12-01 15:30:44,355 INFO L226 Difference]: Without dead ends: 488 [2020-12-01 15:30:44,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2020-12-01 15:30:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-01 15:30:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 302. [2020-12-01 15:30:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-12-01 15:30:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 345 transitions. [2020-12-01 15:30:44,439 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 345 transitions. Word has length 58 [2020-12-01 15:30:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:44,439 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 345 transitions. [2020-12-01 15:30:44,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:30:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 345 transitions. [2020-12-01 15:30:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:30:44,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:44,441 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:30:44,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:44,667 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash -754534588, now seen corresponding path program 1 times [2020-12-01 15:30:44,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:44,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883609526] [2020-12-01 15:30:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:44,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883609526] [2020-12-01 15:30:44,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81678627] [2020-12-01 15:30:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:44,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-01 15:30:44,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:45,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:30:45,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:30:45,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:30:45,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:30:45,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:30:45,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:30:45,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:30:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:45,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:45,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-12-01 15:30:45,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887067649] [2020-12-01 15:30:45,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:30:45,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:45,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:30:45,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:30:45,383 INFO L87 Difference]: Start difference. First operand 302 states and 345 transitions. Second operand 16 states. [2020-12-01 15:30:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:48,723 INFO L93 Difference]: Finished difference Result 416 states and 464 transitions. [2020-12-01 15:30:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-12-01 15:30:48,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2020-12-01 15:30:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:48,726 INFO L225 Difference]: With dead ends: 416 [2020-12-01 15:30:48,727 INFO L226 Difference]: Without dead ends: 412 [2020-12-01 15:30:48,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2020-12-01 15:30:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-12-01 15:30:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 212. [2020-12-01 15:30:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-01 15:30:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2020-12-01 15:30:48,813 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 67 [2020-12-01 15:30:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:48,813 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2020-12-01 15:30:48,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:30:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2020-12-01 15:30:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:30:48,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:48,815 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-01 15:30:49,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:49,043 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:49,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:49,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508889, now seen corresponding path program 1 times [2020-12-01 15:30:49,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:49,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970304192] [2020-12-01 15:30:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:49,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970304192] [2020-12-01 15:30:49,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818069138] [2020-12-01 15:30:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:49,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-01 15:30:49,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:49,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:49,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2020-12-01 15:30:49,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414484062] [2020-12-01 15:30:49,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:30:49,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:30:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:30:49,621 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 15 states. [2020-12-01 15:30:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:51,819 INFO L93 Difference]: Finished difference Result 763 states and 850 transitions. [2020-12-01 15:30:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-12-01 15:30:51,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2020-12-01 15:30:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:51,824 INFO L225 Difference]: With dead ends: 763 [2020-12-01 15:30:51,824 INFO L226 Difference]: Without dead ends: 631 [2020-12-01 15:30:51,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=952, Invalid=3080, Unknown=0, NotChecked=0, Total=4032 [2020-12-01 15:30:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-12-01 15:30:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 422. [2020-12-01 15:30:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-12-01 15:30:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 475 transitions. [2020-12-01 15:30:51,960 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 475 transitions. Word has length 74 [2020-12-01 15:30:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:51,961 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 475 transitions. [2020-12-01 15:30:51,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:30:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 475 transitions. [2020-12-01 15:30:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:30:51,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:30:51,963 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-01 15:30:52,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-01 15:30:52,183 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:30:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:30:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1873875675, now seen corresponding path program 1 times [2020-12-01 15:30:52,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:30:52,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765554364] [2020-12-01 15:30:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:30:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:52,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765554364] [2020-12-01 15:30:52,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432861794] [2020-12-01 15:30:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:30:52,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-01 15:30:52,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:30:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:30:52,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:30:52,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-01 15:30:52,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201110658] [2020-12-01 15:30:52,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:30:52,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:30:52,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:30:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:30:52,520 INFO L87 Difference]: Start difference. First operand 422 states and 475 transitions. Second operand 8 states. [2020-12-01 15:30:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:30:53,037 INFO L93 Difference]: Finished difference Result 517 states and 576 transitions. [2020-12-01 15:30:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:30:53,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2020-12-01 15:30:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:30:53,037 INFO L225 Difference]: With dead ends: 517 [2020-12-01 15:30:53,038 INFO L226 Difference]: Without dead ends: 0 [2020-12-01 15:30:53,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:30:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-01 15:30:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-01 15:30:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-01 15:30:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-01 15:30:53,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-12-01 15:30:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:30:53,040 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-01 15:30:53,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:30:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-01 15:30:53,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-01 15:30:53,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:30:53,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-01 15:30:54,250 WARN L197 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 223 [2020-12-01 15:30:54,452 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 148 [2020-12-01 15:30:55,777 WARN L197 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 365 DAG size of output: 327 [2020-12-01 15:30:55,931 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 147 [2020-12-01 15:30:56,429 WARN L197 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 225 [2020-12-01 15:30:57,094 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 308 [2020-12-01 15:30:57,608 WARN L197 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 240 [2020-12-01 15:30:58,208 WARN L197 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 304 [2020-12-01 15:30:58,673 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 305 [2020-12-01 15:30:59,124 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 239 [2020-12-01 15:30:59,864 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 335 [2020-12-01 15:31:00,072 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 213 [2020-12-01 15:31:00,608 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 312 [2020-12-01 15:31:02,740 WARN L197 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 220 DAG size of output: 41 [2020-12-01 15:31:04,108 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 137 DAG size of output: 81 [2020-12-01 15:31:06,969 WARN L197 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 317 DAG size of output: 75 [2020-12-01 15:31:08,086 WARN L197 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2020-12-01 15:31:09,510 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 222 DAG size of output: 47 [2020-12-01 15:31:12,288 WARN L197 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 302 DAG size of output: 79 [2020-12-01 15:31:13,798 WARN L197 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 236 DAG size of output: 44 [2020-12-01 15:31:15,276 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 137 DAG size of output: 81 [2020-12-01 15:31:18,028 WARN L197 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 295 DAG size of output: 74 [2020-12-01 15:31:20,703 WARN L197 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 295 DAG size of output: 80 [2020-12-01 15:31:22,449 WARN L197 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 235 DAG size of output: 42 [2020-12-01 15:31:23,654 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2020-12-01 15:31:26,679 WARN L197 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 326 DAG size of output: 80 [2020-12-01 15:31:29,490 WARN L197 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 191 DAG size of output: 104 [2020-12-01 15:31:32,093 WARN L197 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 303 DAG size of output: 77 [2020-12-01 15:31:32,098 INFO L258 CegarLoopResult]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse24 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse16 (* 2 ULTIMATE.start_main_~l~0)) (.cse2 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse22 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse13 (div (+ .cse24 1) (- 2))) (.cse12 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse15 (< .cse13 .cse12)) (.cse17 (<= 1 ULTIMATE.start_main_~r~0)) (.cse18 (<= ULTIMATE.start_main_~l~0 1)) (.cse19 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse21 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse22)) (.cse23 (< 0 .cse2)) (.cse3 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (div .cse24 (- 2))) (.cse14 (+ (div ULTIMATE.start_main_~j~0 2) 1)) (.cse4 (<= 1 ULTIMATE.start_main_~l~0)) (.cse5 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse7 (<= .cse16 ULTIMATE.start_main_~j~0)) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse11 (<= .cse12 (div ULTIMATE.start_main_~r~0 2))) (.cse0 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse20 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0))) (or (and .cse0 (<= .cse1 (+ .cse2 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse1 .cse12)) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (< .cse13 .cse14) .cse15 (<= .cse16 ULTIMATE.start_main_~r~0)) (and .cse17 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse18 .cse15) (and .cse17 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse18 .cse21) (and .cse19 .cse3 .cse4 .cse5 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse16) .cse22) (<= 2 ULTIMATE.start_main_~i~0) .cse8 .cse11 .cse21 .cse23) (and .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse23) (and .cse3 (<= .cse1 .cse14) .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse0 .cse20 (<= ULTIMATE.start_main_~j~0 .cse16) .cse9 .cse10))))) [2020-12-01 15:31:32,098 INFO L262 CegarLoopResult]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,098 INFO L258 CegarLoopResult]: At program point L18-20(lines 17 22) the Hoare annotation is: (let ((.cse21 (* 2 ULTIMATE.start_main_~n~0)) (.cse19 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse8 (div (+ .cse19 1) (- 2))) (.cse20 (+ ULTIMATE.start_main_~l~0 1)) (.cse11 (+ .cse21 ULTIMATE.start_main_~j~0))) (let ((.cse4 (<= (+ ULTIMATE.start_main_~r~0 5) .cse21)) (.cse7 (< 0 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2))) (.cse0 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse6 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse11)) (.cse5 (<= ULTIMATE.start_main_~l~0 1)) (.cse18 (< .cse8 .cse20)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= .cse10 ULTIMATE.start_main_~j~0)) (.cse16 (<= 2 ULTIMATE.start_main_~j~0)) (.cse12 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse17 (<= 1 ULTIMATE.start_main_~i~0)) (.cse13 (<= .cse20 (div ULTIMATE.start_main_~r~0 2))) (.cse9 (<= .cse10 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse8 (+ ULTIMATE.start_main_~l~0 2)) .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse10) .cse11) .cse12 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse12 .cse17 .cse13 .cse6 .cse9) (and (<= 1 ULTIMATE.start_main_~r~0) .cse1 .cse2 .cse3 .cse14 .cse16 .cse12 .cse17 .cse5 .cse18) (and .cse1 .cse2 .cse3 .cse14 .cse16 .cse12 .cse17 (< .cse8 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse18 .cse9) (and (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse12 .cse17 .cse13 (<= (div .cse19 (- 2)) .cse20) .cse9))))) [2020-12-01 15:31:32,099 INFO L262 CegarLoopResult]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,099 INFO L258 CegarLoopResult]: At program point L18-23(lines 17 22) the Hoare annotation is: (let ((.cse16 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse15 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse12 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse5 (< (div (+ .cse17 1) (- 2)) .cse12)) (.cse6 (<= .cse15 ULTIMATE.start_main_~j~0)) (.cse8 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse9 (div .cse17 (- 2))) (.cse13 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= 2 ULTIMATE.start_main_~j~0)) (.cse11 (<= .cse12 (div ULTIMATE.start_main_~r~0 2))) (.cse14 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse16)) (.cse7 (<= .cse15 ULTIMATE.start_main_~r~0))) (or (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~l~0 1) .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse3 .cse5 .cse7) (and .cse8 .cse0 (<= .cse9 (+ (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2) 1)) .cse1 .cse2 .cse10 .cse4 .cse3 .cse11 (<= .cse9 .cse12) .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse10 .cse6 .cse4 .cse3 .cse11 .cse14 .cse7) (and .cse8 .cse0 (<= .cse9 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse1 .cse2 .cse10 (<= ULTIMATE.start_main_~j~0 .cse15) .cse4 .cse3 .cse11 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse10 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse15) .cse16) .cse4 .cse3 .cse11 .cse14 (<= 3 ULTIMATE.start_main_~j~0) .cse7)))) [2020-12-01 15:31:32,099 INFO L262 CegarLoopResult]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,099 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,100 INFO L258 CegarLoopResult]: At program point L18-26(lines 17 22) the Hoare annotation is: (let ((.cse19 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse14 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse9 (div .cse19 (- 2))) (.cse18 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse12 (<= .cse9 .cse18)) (.cse8 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse7 (< (div (+ .cse19 1) (- 2)) .cse18)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse6 (<= ULTIMATE.start_main_~l~0 1)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= 2 ULTIMATE.start_main_~j~0)) (.cse11 (<= .cse18 (div ULTIMATE.start_main_~r~0 2))) (.cse16 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse17)) (.cse13 (<= .cse14 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 (<= .cse9 (+ (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2) 1)) .cse2 .cse3 .cse10 .cse5 .cse4 .cse11 .cse12 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13) (and .cse8 .cse1 (<= .cse9 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse2 .cse3 .cse10 (<= ULTIMATE.start_main_~j~0 .cse14) .cse5 .cse4 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse10 (<= .cse14 ULTIMATE.start_main_~j~0) .cse5 .cse4 .cse7 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse16 .cse13) (and .cse15 .cse1 .cse2 .cse3 .cse10 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse14) .cse17) .cse5 .cse4 .cse11 .cse16 (<= 3 ULTIMATE.start_main_~j~0) .cse13))))) [2020-12-01 15:31:32,100 INFO L262 CegarLoopResult]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,100 INFO L258 CegarLoopResult]: At program point L18-29(lines 17 22) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~l~0)) (.cse18 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse19 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse17 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse8 (<= 1 ULTIMATE.start_main_~r~0)) (.cse11 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (< (div (+ .cse19 1) (- 2)) .cse17)) (.cse9 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse12 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse18)) (.cse15 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse13 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse14 (div .cse19 (- 2))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 2 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse16 (<= .cse17 (div ULTIMATE.start_main_~r~0 2))) (.cse7 (<= .cse3 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 .cse2 (<= .cse3 ULTIMATE.start_main_~j~0) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6) (and .cse13 (<= .cse14 (+ .cse15 1)) .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 (<= .cse14 .cse17) .cse7) (and .cse9 .cse0 .cse1 .cse2 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse3) .cse18) .cse4 .cse5 .cse16 .cse12 (< 0 .cse15) .cse7) (and .cse13 .cse0 (<= .cse14 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse1 .cse2 .cse10 (<= ULTIMATE.start_main_~j~0 .cse3) .cse4 .cse5 .cse16 .cse7)))) [2020-12-01 15:31:32,100 INFO L262 CegarLoopResult]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,100 INFO L262 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,100 INFO L262 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,100 INFO L258 CegarLoopResult]: At program point L18-32(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~l~0)) (.cse5 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse1 (let ((.cse7 (<= 2 ULTIMATE.start_main_~l~0))) (or (and .cse7 (<= .cse0 ULTIMATE.start_main_~j~0)) (and .cse7 (<= .cse5 (div ULTIMATE.start_main_~r~0 2)))))) (.cse2 (<= .cse0 ULTIMATE.start_main_~r~0))) (or (and (or (and (<= ULTIMATE.start_main_~j~0 .cse0) .cse1 .cse2) (and (<= 2 ULTIMATE.start_main_~i~0) .cse1 .cse2)) .cse3 .cse4 (< (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) 1) (- 2)) .cse5)) (let ((.cse6 (* 2 ULTIMATE.start_main_~n~0))) (and (< 0 (div ULTIMATE.start_main_~j~0 2)) (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse0) (+ .cse6 ULTIMATE.start_main_~j~0)) .cse3 .cse4 (<= (+ ULTIMATE.start_main_~r~0 .cse0 1) .cse6) .cse1 .cse2))))) [2020-12-01 15:31:32,101 INFO L262 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,101 INFO L262 CegarLoopResult]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,101 INFO L262 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,101 INFO L262 CegarLoopResult]: For program point L19-4(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,101 INFO L258 CegarLoopResult]: At program point L18-35(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (<= ULTIMATE.start_main_~r~0 .cse0)) (.cse2 (let ((.cse5 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse6 (<= 2 ULTIMATE.start_main_~l~0)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_main_~l~0 1) (div ULTIMATE.start_main_~r~0 2))) (and .cse5 .cse6 (<= .cse0 ULTIMATE.start_main_~j~0) .cse7 .cse8)))) (.cse3 (<= .cse0 ULTIMATE.start_main_~r~0))) (or (and (<= ULTIMATE.start_main_~j~0 .cse0) .cse1 .cse2 .cse3) (let ((.cse4 (* 2 ULTIMATE.start_main_~n~0))) (and (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse0) (+ .cse4 ULTIMATE.start_main_~j~0)) .cse2 (<= (+ ULTIMATE.start_main_~r~0 .cse0 1) .cse4) .cse3)) (and (<= 2 ULTIMATE.start_main_~i~0) .cse1 .cse2 .cse3)))) [2020-12-01 15:31:32,101 INFO L262 CegarLoopResult]: For program point L19-5(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,102 INFO L262 CegarLoopResult]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,102 INFO L262 CegarLoopResult]: For program point L19-6(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,102 INFO L262 CegarLoopResult]: For program point L19-7(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,102 INFO L258 CegarLoopResult]: At program point L18-38(lines 17 22) the Hoare annotation is: (let ((.cse6 (* 2 ULTIMATE.start_main_~n~0)) (.cse11 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse8 (<= .cse11 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= 2 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~l~0 1)) (.cse9 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse10 (+ ULTIMATE.start_main_~l~0 1)) (.cse7 (<= (+ ULTIMATE.start_main_~r~0 .cse11) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) (+ .cse6 ULTIMATE.start_main_~j~0)) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (div .cse9 (- 2)) .cse10) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (div (+ .cse9 1) (- 2)) .cse10) .cse7)))) [2020-12-01 15:31:32,102 INFO L262 CegarLoopResult]: For program point L19-8(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,102 INFO L262 CegarLoopResult]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,103 INFO L262 CegarLoopResult]: For program point L19-9(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,103 INFO L262 CegarLoopResult]: For program point L19-10(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,103 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,103 INFO L258 CegarLoopResult]: At program point L18-41(lines 17 22) the Hoare annotation is: (let ((.cse7 (* 2 ULTIMATE.start_main_~n~0)) (.cse12 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= .cse12 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 2 ULTIMATE.start_main_~j~0)) (.cse6 (<= ULTIMATE.start_main_~l~0 1)) (.cse10 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse11 (+ ULTIMATE.start_main_~l~0 1)) (.cse8 (<= (+ ULTIMATE.start_main_~r~0 .cse12) .cse7))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) (+ .cse7 ULTIMATE.start_main_~j~0)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (div .cse10 (- 2)) .cse11) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (< (div (+ .cse10 1) (- 2)) .cse11) .cse8)))) [2020-12-01 15:31:32,103 INFO L262 CegarLoopResult]: For program point L19-11(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,104 INFO L262 CegarLoopResult]: For program point L19-12(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,104 INFO L262 CegarLoopResult]: For program point L19-13(line 19) no Hoare annotation was computed. [2020-12-01 15:31:32,104 INFO L265 CegarLoopResult]: At program point L69(lines 24 70) the Hoare annotation is: true [2020-12-01 15:31:32,104 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-01 15:31:32,104 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L258 CegarLoopResult]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse39 (div (+ ULTIMATE.start_main_~j~0 (- 2)) 2)) (.cse40 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse37 (* 2 ULTIMATE.start_main_~n~0))) (let ((.cse32 (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (.cse34 (* 2 ULTIMATE.start_main_~i~0)) (.cse36 (+ .cse37 ULTIMATE.start_main_~j~0)) (.cse15 (div .cse40 (- 2))) (.cse33 (* 2 ULTIMATE.start_main_~l~0)) (.cse16 (div .cse39 2)) (.cse1 (div (+ .cse40 1) (- 2))) (.cse38 (+ ULTIMATE.start_main_~l~0 1)) (.cse35 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse2 (div .cse35 2)) (.cse5 (< .cse1 .cse38)) (.cse21 (< 0 .cse16)) (.cse22 (<= ULTIMATE.start_main_~i~0 (+ .cse39 1))) (.cse0 (< 0 ULTIMATE.start_main_~l~0)) (.cse17 (<= (+ ULTIMATE.start_main_~r~0 .cse33 1) .cse37)) (.cse18 (<= .cse38 (div ULTIMATE.start_main_~r~0 2))) (.cse27 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse13 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse8 (<= 1 ULTIMATE.start_main_~r~0)) (.cse9 (<= 1 ULTIMATE.start_main_~l~0)) (.cse25 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 2 ULTIMATE.start_main_~i~0)) (.cse10 (<= 2 ULTIMATE.start_main_~j~0)) (.cse11 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse12 (<= ULTIMATE.start_main_~l~0 1)) (.cse19 (<= .cse15 .cse38)) (.cse7 (<= (+ ULTIMATE.start_main_~r~0 .cse33) .cse37)) (.cse23 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse33) .cse36)) (.cse14 (<= 1 ULTIMATE.start_main_~i~0)) (.cse26 (<= (+ ULTIMATE.start_main_~r~0 .cse34 5) .cse36)) (.cse24 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) .cse32)) (.cse3 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse29 (+ .cse35 1)) (.cse30 (< 0 .cse35)) (.cse31 (<= .cse33 ULTIMATE.start_main_~j~0)) (.cse28 (<= ULTIMATE.start_main_~j~0 .cse33)) (.cse20 (<= (+ ULTIMATE.start_main_~j~0 4) (+ ULTIMATE.start_main_~r~0 .cse34))) (.cse6 (<= .cse33 ULTIMATE.start_main_~r~0))) (or (and .cse0 (< .cse1 (+ .cse2 1)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse9 (< 0 .cse2) .cse10 .cse11 .cse12 .cse5 .cse7) (and .cse8 .cse0 .cse3 .cse13 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) .cse10 .cse14 .cse12 .cse5 .cse7) (and .cse3 .cse9 (<= .cse15 (+ .cse16 1)) .cse17 .cse18 .cse19 .cse20) (and .cse8 .cse3 .cse21 .cse22 .cse9 .cse4 .cse10 .cse11 .cse12 .cse7) (and .cse4 (or (and .cse0 .cse3 .cse21 .cse22 .cse23 .cse11 .cse18 .cse20) (and .cse0 .cse24 .cse25 .cse23 .cse11 .cse18 .cse26 (< 0 .cse27) .cse20))) (and .cse24 .cse0 .cse25 .cse17 .cse18 .cse19 .cse20 (< .cse1 (+ .cse27 2))) (and .cse13 .cse28 .cse10 .cse14 (< .cse1 .cse29) .cse6 .cse7) (and .cse24 .cse8 .cse3 .cse9 .cse25 .cse4 .cse10 .cse11 .cse12 .cse19 .cse7) (and .cse3 .cse30 .cse23 .cse31 .cse28 .cse14 .cse26 .cse6) (and .cse24 .cse3 (<= .cse15 .cse29) .cse30 .cse31 .cse28 (<= (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) .cse32) .cse20 .cse6))))) [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point L39(lines 39 46) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-01 15:31:32,105 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-12-01 15:31:32,106 INFO L262 CegarLoopResult]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,107 INFO L262 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-7(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-8(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-10(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-11(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-12(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,108 INFO L262 CegarLoopResult]: For program point L12-14(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point L12-15(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point L12-16(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point L12-18(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point L12-19(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point L12-20(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,109 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-22(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-23(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-24(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-26(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-27(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,110 INFO L262 CegarLoopResult]: For program point L12-28(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-30(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-31(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-32(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-34(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-35(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-36(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-38(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,111 INFO L262 CegarLoopResult]: For program point L12-39(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-40(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-42(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-43(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-44(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-46(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-47(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-48(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-50(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,112 INFO L262 CegarLoopResult]: For program point L12-51(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point L12-52(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point L12-54(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point L12-55(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-01 15:31:32,113 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,114 INFO L262 CegarLoopResult]: For program point L49(lines 49 51) no Hoare annotation was computed. [2020-12-01 15:31:32,114 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:31:32,114 INFO L262 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,115 INFO L258 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse30 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse18 (div .cse30 (- 2))) (.cse25 (* 2 ULTIMATE.start_main_~i~0)) (.cse26 (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (.cse27 (* 2 ULTIMATE.start_main_~l~0)) (.cse28 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse29 (div ULTIMATE.start_main_~j~0 2)) (.cse13 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (div (+ .cse30 1) (- 2))) (.cse5 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse3 (<= .cse13 (div ULTIMATE.start_main_~r~0 2))) (.cse15 (+ .cse29 1)) (.cse22 (< 0 .cse29)) (.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse27) .cse28)) (.cse23 (<= .cse27 ULTIMATE.start_main_~j~0)) (.cse14 (<= ULTIMATE.start_main_~j~0 .cse27)) (.cse24 (<= (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) .cse26)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse6 (<= (+ ULTIMATE.start_main_~r~0 .cse25 5) .cse28)) (.cse16 (<= .cse27 ULTIMATE.start_main_~r~0)) (.cse17 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) .cse26)) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse19 (<= 1 ULTIMATE.start_main_~l~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse11 (<= ULTIMATE.start_main_~l~0 1)) (.cse20 (<= .cse18 .cse13)) (.cse21 (<= (+ ULTIMATE.start_main_~j~0 4) (+ ULTIMATE.start_main_~r~0 .cse25)))) (or (and (< 0 ULTIMATE.start_main_~l~0) (<= 2 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse3 .cse4 (< 0 .cse5) .cse6) (and .cse7 .cse8 .cse2 .cse9 .cse10 .cse4 .cse11 (< .cse12 .cse13)) (and .cse0 (or (and .cse8 .cse2 .cse14 .cse9 .cse10 (< .cse12 .cse15) .cse16) (and .cse17 (<= .cse18 (+ .cse5 1)) .cse19 .cse2 .cse3 .cse4 .cse20 .cse21))) (and .cse17 (<= .cse18 .cse15) .cse22 .cse0 .cse23 .cse14 .cse24 .cse21 .cse16) (and .cse22 .cse0 .cse1 .cse23 .cse14 .cse24 .cse10 .cse6 .cse16) (and .cse17 .cse7 .cse19 .cse2 .cse9 .cse4 .cse11 .cse20 .cse21))))) [2020-12-01 15:31:32,115 INFO L262 CegarLoopResult]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,116 INFO L258 CegarLoopResult]: At program point L18-5(lines 17 22) the Hoare annotation is: (let ((.cse22 (* 2 ULTIMATE.start_main_~l~0)) (.cse24 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse26 (div ULTIMATE.start_main_~j~0 2)) (.cse23 (* 2 ULTIMATE.start_main_~i~0)) (.cse27 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse25 (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (.cse7 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse5 (<= .cse7 (div ULTIMATE.start_main_~r~0 2))) (.cse3 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse6 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) .cse25)) (.cse2 (div .cse27 (- 2))) (.cse8 (<= (+ ULTIMATE.start_main_~j~0 4) (+ ULTIMATE.start_main_~r~0 .cse23))) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse14 (div (+ .cse27 1) (- 2))) (.cse15 (+ .cse26 1)) (.cse16 (< 0 .cse26)) (.cse17 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse22) .cse24)) (.cse18 (<= .cse22 ULTIMATE.start_main_~j~0)) (.cse19 (<= ULTIMATE.start_main_~j~0 .cse22)) (.cse20 (<= (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) .cse25)) (.cse13 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (<= (+ ULTIMATE.start_main_~r~0 .cse23 5) .cse24)) (.cse21 (<= .cse22 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 (<= .cse2 (+ .cse3 1)) (<= 1 ULTIMATE.start_main_~l~0) .cse4 .cse5 .cse6 (<= .cse2 .cse7) .cse8) (and (< 0 ULTIMATE.start_main_~l~0) .cse1 (<= 2 ULTIMATE.start_main_~i~0) .cse9 .cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse5 .cse6 (< 0 .cse3) .cse10) (and .cse1 .cse11 .cse4 .cse12 .cse13 .cse6 (<= ULTIMATE.start_main_~l~0 1) (< .cse14 .cse7)) (and .cse0 (<= .cse2 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21) (and .cse1 .cse11 .cse4 .cse19 .cse12 .cse13 (< .cse14 .cse15) .cse21) (and .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse13 .cse10 .cse21)))) [2020-12-01 15:31:32,116 INFO L262 CegarLoopResult]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,116 INFO L258 CegarLoopResult]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse30 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse18 (div .cse30 (- 2))) (.cse25 (* 2 ULTIMATE.start_main_~i~0)) (.cse26 (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (.cse27 (* 2 ULTIMATE.start_main_~l~0)) (.cse28 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse29 (div ULTIMATE.start_main_~j~0 2)) (.cse13 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (div (+ .cse30 1) (- 2))) (.cse5 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse3 (<= .cse13 (div ULTIMATE.start_main_~r~0 2))) (.cse15 (+ .cse29 1)) (.cse22 (< 0 .cse29)) (.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse27) .cse28)) (.cse23 (<= .cse27 ULTIMATE.start_main_~j~0)) (.cse14 (<= ULTIMATE.start_main_~j~0 .cse27)) (.cse24 (<= (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) .cse26)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse6 (<= (+ ULTIMATE.start_main_~r~0 .cse25 5) .cse28)) (.cse16 (<= .cse27 ULTIMATE.start_main_~r~0)) (.cse17 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) .cse26)) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse19 (<= 1 ULTIMATE.start_main_~l~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse11 (<= ULTIMATE.start_main_~l~0 1)) (.cse20 (<= .cse18 .cse13)) (.cse21 (<= (+ ULTIMATE.start_main_~j~0 4) (+ ULTIMATE.start_main_~r~0 .cse25)))) (or (and (< 0 ULTIMATE.start_main_~l~0) (<= 2 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse3 .cse4 (< 0 .cse5) .cse6) (and .cse7 .cse8 .cse2 .cse9 .cse10 .cse4 .cse11 (< .cse12 .cse13)) (and .cse0 (or (and .cse8 .cse2 .cse14 .cse9 .cse10 (< .cse12 .cse15) .cse16) (and .cse17 (<= .cse18 (+ .cse5 1)) .cse19 .cse2 .cse3 .cse4 .cse20 .cse21))) (and .cse17 (<= .cse18 .cse15) .cse22 .cse0 .cse23 .cse14 .cse24 .cse21 .cse16) (and .cse22 .cse0 .cse1 .cse23 .cse14 .cse24 .cse10 .cse6 .cse16) (and .cse17 .cse7 .cse19 .cse2 .cse9 .cse4 .cse11 .cse20 .cse21))))) [2020-12-01 15:31:32,117 INFO L262 CegarLoopResult]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,117 INFO L258 CegarLoopResult]: At program point L18-11(lines 17 22) the Hoare annotation is: (let ((.cse22 (* 2 ULTIMATE.start_main_~l~0)) (.cse24 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse26 (div ULTIMATE.start_main_~j~0 2)) (.cse23 (* 2 ULTIMATE.start_main_~i~0)) (.cse27 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse25 (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (.cse7 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse5 (<= .cse7 (div ULTIMATE.start_main_~r~0 2))) (.cse3 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2)) (.cse6 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) .cse25)) (.cse2 (div .cse27 (- 2))) (.cse8 (<= (+ ULTIMATE.start_main_~j~0 4) (+ ULTIMATE.start_main_~r~0 .cse23))) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse14 (div (+ .cse27 1) (- 2))) (.cse15 (+ .cse26 1)) (.cse16 (< 0 .cse26)) (.cse17 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse22) .cse24)) (.cse18 (<= .cse22 ULTIMATE.start_main_~j~0)) (.cse19 (<= ULTIMATE.start_main_~j~0 .cse22)) (.cse20 (<= (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) .cse25)) (.cse13 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (<= (+ ULTIMATE.start_main_~r~0 .cse23 5) .cse24)) (.cse21 (<= .cse22 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 (<= .cse2 (+ .cse3 1)) (<= 1 ULTIMATE.start_main_~l~0) .cse4 .cse5 .cse6 (<= .cse2 .cse7) .cse8) (and (< 0 ULTIMATE.start_main_~l~0) .cse1 (<= 2 ULTIMATE.start_main_~i~0) .cse9 .cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse5 .cse6 (< 0 .cse3) .cse10) (and .cse1 .cse11 .cse4 .cse12 .cse13 .cse6 (<= ULTIMATE.start_main_~l~0 1) (< .cse14 .cse7)) (and .cse0 (<= .cse2 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21) (and .cse1 .cse11 .cse4 .cse19 .cse12 .cse13 (< .cse14 .cse15) .cse21) (and .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse13 .cse10 .cse21)))) [2020-12-01 15:31:32,118 INFO L262 CegarLoopResult]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,118 INFO L258 CegarLoopResult]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse21 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse19 (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (.cse16 (* 2 ULTIMATE.start_main_~l~0)) (.cse15 (div (+ .cse21 1) (- 2))) (.cse20 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse10 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse14 (<= (div .cse21 (- 2)) .cse20)) (.cse9 (< .cse15 .cse20)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse4 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (<= .cse16 ULTIMATE.start_main_~j~0)) (.cse6 (<= 2 ULTIMATE.start_main_~j~0)) (.cse7 (<= 1 ULTIMATE.start_main_~i~0)) (.cse17 (<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse11 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse13 (<= .cse20 (div ULTIMATE.start_main_~r~0 2))) (.cse18 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 5) .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 (< .cse15 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse9 (<= .cse16 ULTIMATE.start_main_~r~0)) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse18) (and .cse17 .cse2 .cse3 (<= 2 ULTIMATE.start_main_~i~0) .cse11 (<= (+ (* 2 ULTIMATE.start_main_~r~0) .cse16) .cse19) .cse5 .cse13 .cse18 (< 0 (div (+ ULTIMATE.start_main_~j~0 (- 1)) 2))))))) [2020-12-01 15:31:32,119 INFO L262 CegarLoopResult]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2020-12-01 15:31:32,119 INFO L262 CegarLoopResult]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2020-12-01 15:31:32,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:31:32 BoogieIcfgContainer [2020-12-01 15:31:32,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:31:32,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:31:32,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:31:32,235 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:31:32,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:30:22" (3/4) ... [2020-12-01 15:31:32,240 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-01 15:31:32,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-12-01 15:31:32,259 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-01 15:31:32,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-01 15:31:32,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:31:32,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4c5858f9-8683-4500-ada5-a81705c5e871/bin/uautomizer/witness.graphml [2020-12-01 15:31:32,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:31:32,349 INFO L168 Benchmark]: Toolchain (without parser) took 71618.74 ms. Allocated memory was 92.3 MB in the beginning and 524.3 MB in the end (delta: 432.0 MB). Free memory was 65.6 MB in the beginning and 322.2 MB in the end (delta: -256.5 MB). Peak memory consumption was 175.0 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,350 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 92.3 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:31:32,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.55 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 65.3 MB in the beginning and 110.7 MB in the end (delta: -45.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.50 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,351 INFO L168 Benchmark]: Boogie Preprocessor took 36.73 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,352 INFO L168 Benchmark]: RCFGBuilder took 860.94 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 81.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,352 INFO L168 Benchmark]: TraceAbstraction took 70204.44 ms. Allocated memory was 134.2 MB in the beginning and 524.3 MB in the end (delta: 390.1 MB). Free memory was 81.3 MB in the beginning and 329.5 MB in the end (delta: -248.2 MB). Peak memory consumption was 296.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,353 INFO L168 Benchmark]: Witness Printer took 113.57 ms. Allocated memory is still 524.3 MB. Free memory was 329.5 MB in the beginning and 322.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:31:32,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 92.3 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 340.55 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 65.3 MB in the beginning and 110.7 MB in the end (delta: -45.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.50 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.73 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 860.94 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 81.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 70204.44 ms. Allocated memory was 134.2 MB in the beginning and 524.3 MB in the end (delta: 390.1 MB). Free memory was 81.3 MB in the beginning and 329.5 MB in the end (delta: -248.2 MB). Peak memory consumption was 296.4 MB. Max. memory is 16.1 GB. * Witness Printer took 113.57 ms. Allocated memory is still 524.3 MB. Free memory was 329.5 MB in the beginning and 322.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((j <= 2 * l && r <= 2 * l) && (((((!(0 == cond) && 2 <= l) && r <= n) && 2 <= j) && l + 1 <= r / 2) || ((((!(0 == cond) && 2 <= l) && 2 * l <= j) && r <= n) && 2 <= j))) && 2 * l <= r) || (((2 * r + 2 * l <= 2 * n + j && (((((!(0 == cond) && 2 <= l) && r <= n) && 2 <= j) && l + 1 <= r / 2) || ((((!(0 == cond) && 2 <= l) && 2 * l <= j) && r <= n) && 2 <= j))) && r + 2 * l + 1 <= 2 * n) && 2 * l <= r)) || (((2 <= i && r <= 2 * l) && (((((!(0 == cond) && 2 <= l) && r <= n) && 2 <= j) && l + 1 <= r / 2) || ((((!(0 == cond) && 2 <= l) && 2 * l <= j) && r <= n) && 2 <= j))) && 2 * l <= r) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((0 < l && 2 <= i) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && j + 1 <= n) && r <= n) && l + 1 <= r / 2) && j <= r) && 0 < (j + -1) / 2) && r + 2 * i + 5 <= 2 * n + j) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || (1 == cond && (((((((i + 1 <= n && j + 1 <= n) && j <= 2 * l) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && 2 * l <= r) || (((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j + 1 <= n) && l + 1 <= r / 2) && j <= r) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i)))) || ((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= j / 2 + 1) && 0 < j / 2) && 1 == cond) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && j + 4 <= r + 2 * i) && 2 * l <= r)) || ((((((((0 < j / 2 && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || ((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && 1 <= l) && j + 1 <= n) && 2 <= j) && j <= r) && l <= 1) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && 2 <= j) && r <= n) && l <= 1) && (r * -1 + 1) / -2 < l + 1) || (((((((!(0 == cond) && 1 <= l) && j <= n) && 2 * l <= j) && r <= n) && 2 <= j) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j <= n) && 1 == cond) && r <= n) && 2 <= j) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && 2 * l <= r)) || ((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 1 == cond) && 2 * l <= j) && r <= n) && 2 <= j) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= j / 2 + 1) && 1 <= l) && j <= n) && 1 == cond) && j <= 2 * l) && r <= n) && 2 <= j) && l + 1 <= r / 2) && 2 * l <= r)) || (((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && 2 <= j) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 3 <= j) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j + 1 <= n) && l + 1 <= r / 2) && j <= r) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i) || (((((((((0 < l && !(0 == cond)) && 2 <= i) && 2 * r + 2 * l <= 2 * n + j) && j + 1 <= n) && r <= n) && l + 1 <= r / 2) && j <= r) && 0 < (j + -1) / 2) && r + 2 * i + 5 <= 2 * n + j)) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || ((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= j / 2 + 1) && 0 < j / 2) && 1 == cond) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && j + 4 <= r + 2 * i) && 2 * l <= r)) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && j <= 2 * l) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && 2 * l <= r)) || ((((((((0 < j / 2 && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((j <= 2 * l && ((2 <= l && 2 * l <= j) || (2 <= l && l + 1 <= r / 2))) && 2 * l <= r) || ((2 <= i && ((2 <= l && 2 * l <= j) || (2 <= l && l + 1 <= r / 2))) && 2 * l <= r)) && 1 == cond) && r <= n) && (r * -1 + 1) / -2 < l + 1) || ((((((0 < j / 2 && 2 * r + 2 * l <= 2 * n + j) && 1 == cond) && r <= n) && r + 2 * l + 1 <= 2 * n) && ((2 <= l && 2 * l <= j) || (2 <= l && l + 1 <= r / 2))) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && r + 5 <= 2 * n) && l <= 1) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2) && (r * -1 + 1) / -2 < l + 2) && 2 * l <= r) || (((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && r + 5 <= 2 * n) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2)) || (((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && 2 <= j) && r <= n) && 1 <= i) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || (((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 2 <= j) && r <= n) && 1 <= i) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || (((((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && 2 <= j) && r <= n) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r)) || (((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && 2 <= j) && r <= n) && 1 <= i) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && 1 == cond) && r <= n) && 2 <= j) && l <= 1) && r + 2 * i + 5 <= 2 * n + j) && r + 2 * l <= 2 * n) && 2 * l <= r) || (((((((((1 <= r && !(0 == cond)) && 1 <= l) && 1 == cond) && r <= n) && 2 <= j) && l <= 1) && r * -1 / -2 <= l + 1) && r + 2 * l <= 2 * n) && 2 * l <= r)) || (((((((1 <= r && !(0 == cond)) && 1 <= l) && r <= n) && 2 <= j) && l <= 1) && (r * -1 + 1) / -2 < l + 1) && r + 2 * l <= 2 * n) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((0 < l && 2 <= i) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && j + 1 <= n) && r <= n) && l + 1 <= r / 2) && j <= r) && 0 < (j + -1) / 2) && r + 2 * i + 5 <= 2 * n + j) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || (1 == cond && (((((((i + 1 <= n && j + 1 <= n) && j <= 2 * l) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && 2 * l <= r) || (((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j + 1 <= n) && l + 1 <= r / 2) && j <= r) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i)))) || ((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= j / 2 + 1) && 0 < j / 2) && 1 == cond) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && j + 4 <= r + 2 * i) && 2 * l <= r)) || ((((((((0 < j / 2 && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || ((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && 1 <= l) && j + 1 <= n) && 2 <= j) && j <= r) && l <= 1) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((!(0 == cond) && 1 <= l) && j <= n) && 2 * l <= j) && 2 <= j) && r <= n) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r) || (((((((((1 <= r && i + 3 <= n) && !(0 == cond)) && 1 <= l) && j <= n) && 1 == cond) && 2 <= j) && r <= n) && l <= 1) && r + 2 * i + 5 <= 2 * n + j)) || (((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && 2 <= j) && r <= n) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || (((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= (j + -1) / 2 + 1) && !(0 == cond)) && 1 <= l) && j <= n) && 2 <= j) && r <= n) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && 2 * l <= r)) || ((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 2 * r + 2 * l <= 2 * n + j) && 2 <= j) && r <= n) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2) && 2 * l <= r)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= j / 2 + 1) && 1 <= l) && j <= n) && 1 == cond) && j <= 2 * l) && 2 <= j) && r <= n) && l + 1 <= r / 2) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= (j + -1) / 2 + 1) && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && r <= n) && 2 <= j) && 1 <= i) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) || (((((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && r <= n) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r)) || (((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || (((((((((((1 <= r && i + 3 <= n) && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) && r + 2 * i + 5 <= 2 * n + j)) || (((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 2 * r + 2 * l <= 2 * n + j) && 2 <= i) && r <= n) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2)) || (((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && r <= n) && 2 <= j) && 1 <= i) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2)) || ((((((((((((!(0 == cond) && r * -1 / -2 <= j / 2 + 1) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && r <= n) && l + 1 <= r / 2) && i * -1 / -2 <= (n + -2) / 2) && 1 == cond) && j <= 2 * l) && 2 <= j) && 1 <= i) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((1 <= r && !(0 == cond)) && 1 <= l) && r <= n) && 2 <= j) && l <= 1) && r + 2 * i + 5 <= 2 * n + j) && r + 2 * l <= 2 * n) && 2 * l <= r) || ((((((((1 <= r && !(0 == cond)) && 1 <= l) && r <= n) && 2 <= j) && l <= 1) && r * -1 / -2 <= l + 1) && r + 2 * l <= 2 * n) && 2 * l <= r)) || (((((((1 <= r && !(0 == cond)) && 1 <= l) && r <= n) && 2 <= j) && l <= 1) && (r * -1 + 1) / -2 < l + 1) && r + 2 * l <= 2 * n) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j + 1 <= n) && l + 1 <= r / 2) && j <= r) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i) || (((((((((0 < l && !(0 == cond)) && 2 <= i) && 2 * r + 2 * l <= 2 * n + j) && j + 1 <= n) && r <= n) && l + 1 <= r / 2) && j <= r) && 0 < (j + -1) / 2) && r + 2 * i + 5 <= 2 * n + j)) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1) && (r * -1 + 1) / -2 < l + 1)) || ((((((((i * -1 / -2 <= (n + -2) / 2 && r * -1 / -2 <= j / 2 + 1) && 0 < j / 2) && 1 == cond) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && j + 4 <= r + 2 * i) && 2 * l <= r)) || (((((((!(0 == cond) && i + 1 <= n) && j + 1 <= n) && j <= 2 * l) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && 2 * l <= r)) || ((((((((0 < j / 2 && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && 2 <= j) && r <= n) && l <= 1) && (r * -1 + 1) / -2 < l + 1) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= (j + -1) / 2 + 1) && 1 <= l) && j <= n) && 1 == cond) && r <= n) && 2 <= j) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && 2 * l <= r)) || (((((((((i * -1 / -2 <= (n + -2) / 2 && 1 <= r) && !(0 == cond)) && 1 <= l) && j <= n) && 2 <= j) && r <= n) && l <= 1) && r * -1 / -2 <= l + 1) && 2 * l <= r)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= j / 2 + 1) && 1 <= l) && j <= n) && 1 == cond) && j <= 2 * l) && r <= n) && 2 <= j) && l + 1 <= r / 2) && 2 * l <= r)) || ((((((((!(0 == cond) && 1 <= l) && j <= n) && 1 == cond) && 2 * l <= j) && r <= n) && 2 <= j) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r)) || ((((((((((1 <= r && i + 3 <= n) && !(0 == cond)) && 1 <= l) && j <= n) && 1 == cond) && 2 <= j) && r <= n) && l <= 1) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || (((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && 2 <= j) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 3 <= j) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) && (r * -1 + 1) / -2 < l + 1) || (((((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && 2 * l <= j) && r <= n) && 2 <= j) && 1 <= i) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && 1 <= r) && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) && r * -1 / -2 <= l + 1)) || ((((((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && r <= n) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r)) || (((((((((((i + 3 <= n && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && 2 * l <= j) && r <= n) && 2 <= j) && 1 <= i) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j)) || (((((((((i + 3 <= n && 1 <= l) && j <= n) && 2 <= i) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((0 < l && (r * -1 + 1) / -2 < j / 2 / 2 + 1) && !(0 == cond)) && 2 <= i) && (r * -1 + 1) / -2 < l + 1) && 2 * l <= r) && r + 2 * l <= 2 * n) || ((((((((1 <= r && !(0 == cond)) && 1 <= l) && 0 < j / 2 / 2) && 2 <= j) && r <= n) && l <= 1) && (r * -1 + 1) / -2 < l + 1) && r + 2 * l <= 2 * n)) || (((((((((1 <= r && 0 < l) && !(0 == cond)) && i + 1 <= n) && j <= n) && 2 <= j) && 1 <= i) && l <= 1) && (r * -1 + 1) / -2 < l + 1) && r + 2 * l <= 2 * n)) || ((((((!(0 == cond) && 1 <= l) && r * -1 / -2 <= (j + -2) / 2 / 2 + 1) && r + 2 * l + 1 <= 2 * n) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i)) || (((((((((1 <= r && !(0 == cond)) && 0 < (j + -2) / 2 / 2) && i <= (j + -2) / 2 + 1) && 1 <= l) && 2 <= i) && 2 <= j) && r <= n) && l <= 1) && r + 2 * l <= 2 * n)) || (2 <= i && ((((((((0 < l && !(0 == cond)) && 0 < (j + -2) / 2 / 2) && i <= (j + -2) / 2 + 1) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && l + 1 <= r / 2) && j + 4 <= r + 2 * i) || ((((((((0 < l && i * -1 / -2 <= (n + -2) / 2) && 1 == cond) && 2 * r + 2 * l <= 2 * n + j) && r <= n) && l + 1 <= r / 2) && r + 2 * i + 5 <= 2 * n + j) && 0 < (j + -1) / 2) && j + 4 <= r + 2 * i)))) || (((((((i * -1 / -2 <= (n + -2) / 2 && 0 < l) && 1 == cond) && r + 2 * l + 1 <= 2 * n) && l + 1 <= r / 2) && r * -1 / -2 <= l + 1) && j + 4 <= r + 2 * i) && (r * -1 + 1) / -2 < (j + -1) / 2 + 2)) || ((((((i + 1 <= n && j <= 2 * l) && 2 <= j) && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && 2 * l <= r) && r + 2 * l <= 2 * n)) || ((((((((((i * -1 / -2 <= (n + -2) / 2 && 1 <= r) && !(0 == cond)) && 1 <= l) && 1 == cond) && 2 <= i) && 2 <= j) && r <= n) && l <= 1) && r * -1 / -2 <= l + 1) && r + 2 * l <= 2 * n)) || (((((((!(0 == cond) && 0 < j / 2) && 2 * r + 2 * l <= 2 * n + j) && 2 * l <= j) && j <= 2 * l) && 1 <= i) && r + 2 * i + 5 <= 2 * n + j) && 2 * l <= r)) || ((((((((i * -1 / -2 <= (n + -2) / 2 && !(0 == cond)) && r * -1 / -2 <= j / 2 + 1) && 0 < j / 2) && 2 * l <= j) && j <= 2 * l) && j * -1 / -2 <= (n + -2) / 2) && j + 4 <= r + 2 * i) && 2 * l <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 31.1s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1786 SDtfs, 6095 SDslu, 4175 SDs, 0 SdLazy, 5325 SolverSat, 2703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 975 GetRequests, 520 SyntacticMatches, 3 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9512 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2817 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 350 NumberOfFragments, 4772 HoareAnnotationTreeSize, 16 FomulaSimplifications, 260464748581 FormulaSimplificationTreeSizeReduction, 7.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 18598403844 FormulaSimplificationTreeSizeReductionInter, 31.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1211 ConstructedInterpolants, 0 QuantifiedInterpolants, 354361 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1567 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 34 InterpolantComputations, 19 PerfectInterpolantSequences, 266/514 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...