./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/sum20-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/sum20-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c2f5d73c406c3ffc9c27d7cd89dbe0ce5d7ec9b20c32fdf36fe2abec0cffd86 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:46:33,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:46:33,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:46:33,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:46:33,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:46:33,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:46:33,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:46:33,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:46:33,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:46:33,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:46:33,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:46:33,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:46:33,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:46:33,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:46:33,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:46:33,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:46:33,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:46:33,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:46:33,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:46:33,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:46:33,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:46:33,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:46:33,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:46:33,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:46:33,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:46:33,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:46:33,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:46:33,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:46:33,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:46:33,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:46:33,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:46:33,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:46:33,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:46:33,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:46:33,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:46:33,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:46:33,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:46:33,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:46:33,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:46:33,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:46:33,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:46:33,813 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:46:33,865 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:46:33,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:46:33,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:46:33,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:46:33,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:46:33,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:46:33,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:46:33,870 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:46:33,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:46:33,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:46:33,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:46:33,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:46:33,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:46:33,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:46:33,873 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:46:33,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:46:33,874 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:46:33,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:46:33,875 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:46:33,875 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:46:33,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:46:33,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:46:33,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:46:33,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:46:33,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:46:33,877 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:46:33,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:46:33,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:46:33,878 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_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/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_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ 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 -> Kojak 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 -> 7c2f5d73c406c3ffc9c27d7cd89dbe0ce5d7ec9b20c32fdf36fe2abec0cffd86 [2021-11-23 01:46:34,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:46:34,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:46:34,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:46:34,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:46:34,264 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:46:34,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/reducercommutativity/sum20-2.i [2021-11-23 01:46:34,353 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/data/a28d5865f/42fee50fc5fb410f9f776d4b54f69757/FLAGc7dbc67f8 [2021-11-23 01:46:34,912 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:46:34,913 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/sv-benchmarks/c/reducercommutativity/sum20-2.i [2021-11-23 01:46:34,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/data/a28d5865f/42fee50fc5fb410f9f776d4b54f69757/FLAGc7dbc67f8 [2021-11-23 01:46:35,274 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/data/a28d5865f/42fee50fc5fb410f9f776d4b54f69757 [2021-11-23 01:46:35,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:46:35,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:46:35,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:46:35,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:46:35,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:46:35,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260388db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35, skipping insertion in model container [2021-11-23 01:46:35,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:46:35,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:46:35,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/sv-benchmarks/c/reducercommutativity/sum20-2.i[1277,1290] [2021-11-23 01:46:35,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:46:35,547 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:46:35,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/sv-benchmarks/c/reducercommutativity/sum20-2.i[1277,1290] [2021-11-23 01:46:35,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:46:35,588 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:46:35,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35 WrapperNode [2021-11-23 01:46:35,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:46:35,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:46:35,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:46:35,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:46:35,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,657 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2021-11-23 01:46:35,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:46:35,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:46:35,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:46:35,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:46:35,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:46:35,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:46:35,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:46:35,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:46:35,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:35" (1/1) ... [2021-11-23 01:46:35,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:46:35,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:46:35,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:46:35,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:46:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:46:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-11-23 01:46:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-11-23 01:46:35,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:46:35,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 01:46:35,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 01:46:35,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:46:35,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:46:35,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 01:46:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 01:46:35,909 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:46:35,910 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:46:36,085 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:46:36,119 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:46:36,119 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-23 01:46:36,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:36 BoogieIcfgContainer [2021-11-23 01:46:36,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:46:36,123 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:46:36,123 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:46:36,147 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:46:36,148 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:36" (1/1) ... [2021-11-23 01:46:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:46:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2021-11-23 01:46:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-11-23 01:46:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 01:46:36,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:36,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 01:46:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2021-11-23 01:46:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-11-23 01:46:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:46:36,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:36,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 01:46:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2021-11-23 01:46:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-23 01:46:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:46:36,693 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:36,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 01:46:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2021-11-23 01:46:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2021-11-23 01:46:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:46:36,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:36,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 01:46:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2021-11-23 01:46:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2021-11-23 01:46:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:46:37,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:37,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2021-11-23 01:46:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2021-11-23 01:46:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 01:46:37,162 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:37,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2021-11-23 01:46:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2021-11-23 01:46:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:46:37,391 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:37,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2021-11-23 01:46:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2021-11-23 01:46:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 01:46:37,588 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:37,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2021-11-23 01:46:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2021-11-23 01:46:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:46:37,823 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:37,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 26 states and 36 transitions. [2021-11-23 01:46:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-11-23 01:46:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 01:46:38,035 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:38,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2021-11-23 01:46:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-11-23 01:46:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:46:38,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:38,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2021-11-23 01:46:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-11-23 01:46:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:46:38,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:38,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2021-11-23 01:46:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2021-11-23 01:46:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:46:38,605 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:38,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2021-11-23 01:46:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2021-11-23 01:46:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:46:38,829 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:38,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2021-11-23 01:46:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-11-23 01:46:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:46:39,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:39,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2021-11-23 01:46:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2021-11-23 01:46:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:46:39,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:39,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 33 states and 43 transitions. [2021-11-23 01:46:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-11-23 01:46:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:46:39,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:39,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2021-11-23 01:46:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-11-23 01:46:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 01:46:39,819 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:39,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 35 states and 45 transitions. [2021-11-23 01:46:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2021-11-23 01:46:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:46:40,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:40,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2021-11-23 01:46:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2021-11-23 01:46:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 01:46:40,348 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:40,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 37 states and 47 transitions. [2021-11-23 01:46:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2021-11-23 01:46:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 01:46:40,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:40,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2021-11-23 01:46:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2021-11-23 01:46:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 01:46:40,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:40,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2021-11-23 01:46:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2021-11-23 01:46:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 01:46:41,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:41,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2021-11-23 01:46:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2021-11-23 01:46:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 01:46:41,425 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:41,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 01:46:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 41 states and 50 transitions. [2021-11-23 01:46:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2021-11-23 01:46:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:46:41,721 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:41,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-11-23 01:46:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2021-11-23 01:46:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2021-11-23 01:46:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 01:46:41,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:41,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-11-23 01:46:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 43 states and 52 transitions. [2021-11-23 01:46:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2021-11-23 01:46:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 01:46:42,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:42,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2021-11-23 01:46:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 44 states and 53 transitions. [2021-11-23 01:46:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-11-23 01:46:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 01:46:42,475 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:42,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2021-11-23 01:46:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 45 states and 54 transitions. [2021-11-23 01:46:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2021-11-23 01:46:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 01:46:42,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:42,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2021-11-23 01:46:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 46 states and 55 transitions. [2021-11-23 01:46:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2021-11-23 01:46:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-23 01:46:43,031 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:43,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-11-23 01:46:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 47 states and 56 transitions. [2021-11-23 01:46:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-11-23 01:46:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 01:46:43,340 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:43,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2021-11-23 01:46:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2021-11-23 01:46:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2021-11-23 01:46:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 01:46:43,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:43,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2021-11-23 01:46:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 49 states and 58 transitions. [2021-11-23 01:46:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-11-23 01:46:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-23 01:46:43,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:43,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2021-11-23 01:46:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2021-11-23 01:46:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2021-11-23 01:46:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 01:46:44,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:44,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-11-23 01:46:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 51 states and 60 transitions. [2021-11-23 01:46:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-11-23 01:46:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-23 01:46:44,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:44,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2021-11-23 01:46:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 52 states and 61 transitions. [2021-11-23 01:46:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-11-23 01:46:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-23 01:46:44,898 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:44,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-11-23 01:46:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 53 states and 62 transitions. [2021-11-23 01:46:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-23 01:46:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 01:46:45,273 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:45,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 0 proven. 557 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2021-11-23 01:46:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 54 states and 63 transitions. [2021-11-23 01:46:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-11-23 01:46:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 01:46:45,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:45,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2021-11-23 01:46:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 55 states and 64 transitions. [2021-11-23 01:46:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-11-23 01:46:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 01:46:46,084 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:46,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2021-11-23 01:46:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2021-11-23 01:46:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-11-23 01:46:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 01:46:46,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:46,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 803 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2021-11-23 01:46:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2021-11-23 01:46:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2021-11-23 01:46:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 01:46:46,913 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:46,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 895 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2021-11-23 01:46:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2021-11-23 01:46:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-11-23 01:46:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:46:47,327 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:47,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2021-11-23 01:46:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 59 states and 67 transitions. [2021-11-23 01:46:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2021-11-23 01:46:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 01:46:47,766 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:47,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 60 states and 68 transitions. [2021-11-23 01:46:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2021-11-23 01:46:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:46:48,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:48,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 61 states and 69 transitions. [2021-11-23 01:46:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-23 01:46:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 01:46:48,665 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:48,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2179 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 62 states and 70 transitions. [2021-11-23 01:46:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2021-11-23 01:46:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 01:46:49,126 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:49,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2021-11-23 01:46:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-23 01:46:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-23 01:46:49,619 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:49,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 64 states and 72 transitions. [2021-11-23 01:46:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-11-23 01:46:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 01:46:50,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:50,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 65 states and 73 transitions. [2021-11-23 01:46:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-11-23 01:46:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-23 01:46:50,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:50,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 66 states and 74 transitions. [2021-11-23 01:46:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2021-11-23 01:46:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 01:46:51,079 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:51,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 67 states and 75 transitions. [2021-11-23 01:46:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2021-11-23 01:46:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 01:46:51,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:51,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 68 states and 76 transitions. [2021-11-23 01:46:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-11-23 01:46:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-23 01:46:51,968 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:51,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 69 states and 77 transitions. [2021-11-23 01:46:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2021-11-23 01:46:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 01:46:52,428 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:52,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 70 states and 78 transitions. [2021-11-23 01:46:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2021-11-23 01:46:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-23 01:46:52,917 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:52,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 71 states and 79 transitions. [2021-11-23 01:46:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-11-23 01:46:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 01:46:53,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:53,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 72 states and 80 transitions. [2021-11-23 01:46:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-11-23 01:46:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 01:46:53,809 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:53,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 73 states and 81 transitions. [2021-11-23 01:46:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-11-23 01:46:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 01:46:54,209 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:54,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 74 states and 82 transitions. [2021-11-23 01:46:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-11-23 01:46:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 01:46:54,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:54,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2021-11-23 01:46:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-11-23 01:46:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-23 01:46:55,023 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:55,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:46:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2021-11-23 01:46:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:46:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2021-11-23 01:46:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-11-23 01:46:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-23 01:46:55,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:46:55,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:46:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:47:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 0 proven. 2333 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:49:48,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:50:00,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 11.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:50:03,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:50:28,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:50:29,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:51:10,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 01:51:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:51:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 124 states and 149 transitions. [2021-11-23 01:51:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2021-11-23 01:51:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 01:51:11,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:51:11,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:51:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:51:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2422 backedges. 211 proven. 946 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2021-11-23 01:51:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:51:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 74 states and 75 transitions. [2021-11-23 01:51:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-11-23 01:51:15,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 01:51:15,673 WARN L419 CodeCheckObserver]: This Program is SAFE, Check terminated with 62 iterations. [2021-11-23 01:51:15,682 INFO L754 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2021-11-23 01:51:22,497 WARN L227 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 694 DAG size of output: 1 (called from [L 651] de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.computeHoareAnnotation) [2021-11-23 01:51:22,660 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2021-11-23 01:51:22,666 INFO L560 CodeCheckObserver]: Invariant with dag size 310 [2021-11-23 01:51:22,775 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2021-11-23 01:51:22,776 INFO L560 CodeCheckObserver]: Invariant with dag size 10 [2021-11-23 01:51:22,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:51:22 ImpRootNode [2021-11-23 01:51:22,777 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:51:22,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:51:22,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:51:22,779 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:51:22,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:36" (3/4) ... [2021-11-23 01:51:22,783 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 01:51:22,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2021-11-23 01:51:22,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-23 01:51:22,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-23 01:51:22,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-23 01:51:22,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 01:51:22,882 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:51:22,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:51:22,883 INFO L158 Benchmark]: Toolchain (without parser) took 287587.08ms. Allocated memory was 98.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 64.2MB in the beginning and 837.3MB in the end (delta: -773.1MB). Peak memory consumption was 324.6MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,884 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 69.5MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:51:22,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.82ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 74.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.56ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:51:22,886 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 98.6MB. Free memory was 72.4MB in the beginning and 71.4MB in the end (delta: 956.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,886 INFO L158 Benchmark]: RCFGBuilder took 433.96ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 59.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,886 INFO L158 Benchmark]: CodeCheck took 286654.52ms. Allocated memory was 98.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 59.8MB in the beginning and 843.6MB in the end (delta: -783.8MB). Peak memory consumption was 317.2MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,887 INFO L158 Benchmark]: Witness Printer took 103.96ms. Allocated memory is still 1.2GB. Free memory was 843.6MB in the beginning and 837.3MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 01:51:22,890 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 279.5s, OverallIterations: 62, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2513 SdHoareTripleChecker+Valid, 104.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 91.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7734 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8898 IncrementalHoareTripleChecker+Invalid, 16636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7734 mSolverCounterUnsat, 809 mSDtfsCounter, 8898 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19535 GetRequests, 18372 SyntacticMatches, 535 SemanticMatches, 628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166576 ImplicationChecksByTransitivity, 213.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 60.2s InterpolantComputationTime, 4270 NumberOfCodeBlocks, 4270 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 4209 ConstructedInterpolants, 0 QuantifiedInterpolants, 91473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 2 PerfectInterpolantSequences, 48743/61602 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] <= ret)) && x + 4 * i <= x + 28) && x == x) && x + 28 <= x + 4 * i) && 6 < i) && i <= 7) || (((((9 < i && i <= 10) && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12]))) && x == x) && 40 + x <= x + 4 * i) && x + 4 * i <= 40 + x)) || (((((x + 4 * i <= x + 36 && (((ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] <= ret) || 1 <= x) || x + 1 <= 0)) && 8 < i) && x == x) && i <= 9) && x + 36 <= x + 4 * i)) || (((((x + 12 <= x + 4 * i && i <= 3) && 2 < i) && x == x) && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8]))) && x + 4 * i <= x + 12)) || (((((x + 4 * i <= 64 + x && i <= 16) && 15 < i) && x == x) && 64 + x <= x + 4 * i) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret)))) || (((((x + 60 <= x + 4 * i && i <= 15) && 14 < i) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret))) && x == x) && x + 4 * i <= x + 60)) || (((((13 < i && x + 4 * i <= 56 + x) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret))) && x == x) && i <= 14) && 56 + x <= x + 4 * i)) || (((((x + 4 <= x + 4 * i && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][0] <= ret && ret <= unknown-#memory_int-unknown[x][0]))) && i <= 1) && x == x) && 1 <= i) && x + 4 * i <= x + 4)) || (((((3 < i && x + 4 * i <= 16 + x) && x == x) && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]))) && 16 + x <= x + 4 * i) && i <= 4)) || (((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] && unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][76 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][x + 36] <= ret)) && 19 < i)) || (((((18 < i && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][72 + x] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12]))) && 76 + x <= x + 4 * i) && i <= 19) && x == x) && x + 4 * i <= 76 + x)) || (((((17 < i && 72 + x <= x + 4 * i) && x == x) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][68 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret))) && x + 4 * i <= 72 + x) && i <= 18)) || (((((1 < i && i <= 2) && x + 8 <= x + 4 * i) && x == x) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] <= ret))) && x + 4 * i <= x + 8)) || (((((i <= 17 && x + 4 * i <= 68 + x) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 60] + unknown-#memory_int-unknown[x][52 + x] + unknown-#memory_int-unknown[x][56 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][64 + x] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret))) && x == x) && 16 < i) && 68 + x <= x + 4 * i)) || ((((x <= x && ret == 0) && i == 0) && x <= x) && x == x)) || (((((5 < i && x + 4 * i <= x + 24) && ((1 <= x || (ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= ret)) || x + 1 <= 0)) && i <= 6) && x == x) && x + 24 <= x + 4 * i)) || (((((x + 48 <= x + 4 * i && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12]))) && 11 < i) && i <= 12) && x == x) && x + 4 * i <= x + 48)) || (((((4 < i && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]))) && i <= 5) && x + 20 <= x + 4 * i) && x == x) && x + 4 * i <= x + 20)) || (((((7 < i && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 12] <= ret))) && 32 + x <= x + 4 * i) && x + 4 * i <= 32 + x) && i <= 8) && x == x)) || (((((52 + x <= x + 4 * i && i <= 13) && 12 < i) && x == x) && x + 4 * i <= 52 + x) && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][44 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][48] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12])))) || (((((10 < i && x == x) && 44 + x <= x + 4 * i) && ((1 <= x || x + 1 <= 0) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12] <= ret && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][40 + x] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + 36] + unknown-#memory_int-unknown[x][x + 12]))) && x + 4 * i <= 44 + x) && i <= 11) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (x == 0 && 1 <= i) || (i == 0 && x == 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 69.5MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.82ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 74.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.56ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 98.6MB. Free memory was 72.4MB in the beginning and 71.4MB in the end (delta: 956.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 433.96ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 59.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 286654.52ms. Allocated memory was 98.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 59.8MB in the beginning and 843.6MB in the end (delta: -783.8MB). Peak memory consumption was 317.2MB. Max. memory is 16.1GB. * Witness Printer took 103.96ms. Allocated memory is still 1.2GB. Free memory was 843.6MB in the beginning and 837.3MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2021-11-23 01:51:22,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da60f124-5116-419c-a079-0a3483faee4a/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE