./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 22:47:59,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 22:47:59,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 22:47:59,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 22:47:59,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 22:47:59,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 22:47:59,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 22:47:59,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 22:47:59,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 22:47:59,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 22:47:59,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 22:47:59,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 22:47:59,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 22:47:59,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 22:47:59,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 22:47:59,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 22:47:59,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 22:47:59,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 22:47:59,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 22:47:59,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 22:47:59,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 22:47:59,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 22:47:59,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 22:47:59,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 22:47:59,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 22:47:59,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 22:47:59,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 22:47:59,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 22:47:59,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 22:47:59,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 22:47:59,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 22:47:59,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 22:47:59,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 22:47:59,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 22:47:59,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 22:47:59,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 22:47:59,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 22:47:59,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 22:47:59,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 22:47:59,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 22:47:59,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 22:47:59,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2022-12-14 22:47:59,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 22:47:59,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 22:47:59,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 22:47:59,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 22:47:59,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 22:47:59,197 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 22:47:59,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 22:47:59,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 22:47:59,198 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 22:47:59,198 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 22:47:59,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 22:47:59,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:47:59,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 22:47:59,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 22:47:59,199 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 22:47:59,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 22:47:59,199 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_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/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_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-12-14 22:47:59,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 22:47:59,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 22:47:59,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 22:47:59,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 22:47:59,400 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 22:47:59,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-12-14 22:48:01,936 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 22:48:02,107 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 22:48:02,108 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-12-14 22:48:02,113 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/data/fd706e9fe/3455573f866544b0b0244455682eb6e4/FLAG32260f3b0 [2022-12-14 22:48:02,508 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/data/fd706e9fe/3455573f866544b0b0244455682eb6e4 [2022-12-14 22:48:02,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 22:48:02,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 22:48:02,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 22:48:02,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 22:48:02,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 22:48:02,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43192cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02, skipping insertion in model container [2022-12-14 22:48:02,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 22:48:02,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 22:48:02,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:48:02,660 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 22:48:02,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:48:02,678 INFO L208 MainTranslator]: Completed translation [2022-12-14 22:48:02,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02 WrapperNode [2022-12-14 22:48:02,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 22:48:02,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 22:48:02,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 22:48:02,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 22:48:02,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,701 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-12-14 22:48:02,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 22:48:02,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 22:48:02,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 22:48:02,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 22:48:02,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 22:48:02,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 22:48:02,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 22:48:02,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 22:48:02,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:48:02" (1/1) ... [2022-12-14 22:48:02,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:48:02,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 22:48:02,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 22:48:02,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 22:48:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 22:48:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 22:48:02,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 22:48:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 22:48:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 22:48:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 22:48:02,834 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 22:48:02,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 22:48:03,023 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 22:48:03,040 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 22:48:03,040 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 22:48:03,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:48:03 BoogieIcfgContainer [2022-12-14 22:48:03,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 22:48:03,043 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 22:48:03,043 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 22:48:03,051 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 22:48:03,051 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:48:03" (1/1) ... [2022-12-14 22:48:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 22:48:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 54 states and 58 transitions. [2022-12-14 22:48:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-12-14 22:48:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 22:48:03,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 53 states and 57 transitions. [2022-12-14 22:48:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-12-14 22:48:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 22:48:03,428 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2022-12-14 22:48:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-12-14 22:48:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 22:48:03,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 51 states and 55 transitions. [2022-12-14 22:48:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-12-14 22:48:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 22:48:03,795 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 50 states and 54 transitions. [2022-12-14 22:48:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-12-14 22:48:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 22:48:04,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 49 states and 53 transitions. [2022-12-14 22:48:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-12-14 22:48:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 22:48:04,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 48 states and 52 transitions. [2022-12-14 22:48:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-14 22:48:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 22:48:04,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 47 states and 51 transitions. [2022-12-14 22:48:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-12-14 22:48:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 22:48:05,142 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 46 states and 50 transitions. [2022-12-14 22:48:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-12-14 22:48:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 22:48:05,703 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 47 states and 53 transitions. [2022-12-14 22:48:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-12-14 22:48:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 22:48:05,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 48 states and 58 transitions. [2022-12-14 22:48:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-12-14 22:48:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 22:48:06,005 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2022-12-14 22:48:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-12-14 22:48:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 22:48:06,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 54 states and 75 transitions. [2022-12-14 22:48:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2022-12-14 22:48:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 22:48:07,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 56 states and 80 transitions. [2022-12-14 22:48:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2022-12-14 22:48:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 22:48:07,933 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 55 states and 79 transitions. [2022-12-14 22:48:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2022-12-14 22:48:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 22:48:07,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 57 states and 83 transitions. [2022-12-14 22:48:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-12-14 22:48:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 22:48:08,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 56 states and 82 transitions. [2022-12-14 22:48:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2022-12-14 22:48:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 22:48:08,048 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 57 states and 83 transitions. [2022-12-14 22:48:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-12-14 22:48:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:48:08,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 57 states and 82 transitions. [2022-12-14 22:48:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-12-14 22:48:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:48:08,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 61 states and 86 transitions. [2022-12-14 22:48:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2022-12-14 22:48:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:48:08,702 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 67 states and 97 transitions. [2022-12-14 22:48:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2022-12-14 22:48:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:48:09,813 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 73 states and 109 transitions. [2022-12-14 22:48:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2022-12-14 22:48:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:48:11,404 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 72 states and 108 transitions. [2022-12-14 22:48:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2022-12-14 22:48:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:48:11,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 74 states and 111 transitions. [2022-12-14 22:48:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2022-12-14 22:48:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:48:11,482 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 73 states and 110 transitions. [2022-12-14 22:48:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2022-12-14 22:48:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:48:11,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 74 states and 115 transitions. [2022-12-14 22:48:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2022-12-14 22:48:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:48:11,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 79 states and 124 transitions. [2022-12-14 22:48:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2022-12-14 22:48:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:48:13,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 88 states and 141 transitions. [2022-12-14 22:48:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 141 transitions. [2022-12-14 22:48:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:48:15,030 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:15,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 97 states and 159 transitions. [2022-12-14 22:48:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-12-14 22:48:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:48:16,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:16,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 101 states and 167 transitions. [2022-12-14 22:48:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 167 transitions. [2022-12-14 22:48:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:48:17,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 104 states and 173 transitions. [2022-12-14 22:48:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 173 transitions. [2022-12-14 22:48:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:18,248 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:48:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 105 states and 173 transitions. [2022-12-14 22:48:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 173 transitions. [2022-12-14 22:48:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:18,604 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:48:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 106 states and 173 transitions. [2022-12-14 22:48:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions. [2022-12-14 22:48:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:18,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 105 states and 172 transitions. [2022-12-14 22:48:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2022-12-14 22:48:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:18,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 107 states and 175 transitions. [2022-12-14 22:48:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 175 transitions. [2022-12-14 22:48:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:18,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 106 states and 174 transitions. [2022-12-14 22:48:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 174 transitions. [2022-12-14 22:48:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:19,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 107 states and 182 transitions. [2022-12-14 22:48:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 182 transitions. [2022-12-14 22:48:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:19,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 108 states and 184 transitions. [2022-12-14 22:48:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 184 transitions. [2022-12-14 22:48:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 22:48:19,680 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 111 states and 189 transitions. [2022-12-14 22:48:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-12-14 22:48:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 22:48:20,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 116 states and 198 transitions. [2022-12-14 22:48:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 198 transitions. [2022-12-14 22:48:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 22:48:20,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 121 states and 205 transitions. [2022-12-14 22:48:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 205 transitions. [2022-12-14 22:48:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 22:48:20,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 122 states and 207 transitions. [2022-12-14 22:48:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 207 transitions. [2022-12-14 22:48:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 22:48:20,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 22:48:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 123 states and 207 transitions. [2022-12-14 22:48:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 207 transitions. [2022-12-14 22:48:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 22:48:21,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 131 states and 221 transitions. [2022-12-14 22:48:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 221 transitions. [2022-12-14 22:48:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 22:48:25,187 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:48:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 132 states and 221 transitions. [2022-12-14 22:48:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 221 transitions. [2022-12-14 22:48:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 22:48:25,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:48:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 133 states and 221 transitions. [2022-12-14 22:48:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 221 transitions. [2022-12-14 22:48:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 22:48:25,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 137 states and 227 transitions. [2022-12-14 22:48:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 227 transitions. [2022-12-14 22:48:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 22:48:26,021 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 140 states and 231 transitions. [2022-12-14 22:48:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 231 transitions. [2022-12-14 22:48:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 22:48:26,538 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 142 states and 234 transitions. [2022-12-14 22:48:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 234 transitions. [2022-12-14 22:48:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 22:48:26,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:48:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 144 states and 236 transitions. [2022-12-14 22:48:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 236 transitions. [2022-12-14 22:48:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 22:48:26,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 151 states and 248 transitions. [2022-12-14 22:48:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 248 transitions. [2022-12-14 22:48:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:48:33,976 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 156 states and 253 transitions. [2022-12-14 22:48:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2022-12-14 22:48:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:48:37,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 22:48:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 157 states and 256 transitions. [2022-12-14 22:48:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 256 transitions. [2022-12-14 22:48:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:48:38,558 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 22:48:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 158 states and 257 transitions. [2022-12-14 22:48:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 257 transitions. [2022-12-14 22:48:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:48:38,853 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 161 states and 259 transitions. [2022-12-14 22:48:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 259 transitions. [2022-12-14 22:48:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:48:41,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 171 states and 272 transitions. [2022-12-14 22:48:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 272 transitions. [2022-12-14 22:48:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 22:48:51,588 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:48:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:48:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:48:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 178 states and 279 transitions. [2022-12-14 22:48:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 279 transitions. [2022-12-14 22:48:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 22:48:57,656 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:48:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:48:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:49:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:49:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:49:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 194 states and 302 transitions. [2022-12-14 22:49:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 302 transitions. [2022-12-14 22:49:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:49:25,728 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:49:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:49:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:49:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 22:49:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:49:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 218 states and 334 transitions. [2022-12-14 22:49:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 334 transitions. [2022-12-14 22:49:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:49:52,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:49:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:49:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:49:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 22:50:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 222 states and 340 transitions. [2022-12-14 22:50:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 340 transitions. [2022-12-14 22:50:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:50:17,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 22:50:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 225 states and 343 transitions. [2022-12-14 22:50:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 343 transitions. [2022-12-14 22:50:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:50:21,095 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 22:50:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 225 states and 342 transitions. [2022-12-14 22:50:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 342 transitions. [2022-12-14 22:50:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 22:50:24,187 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 22:50:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 229 states and 346 transitions. [2022-12-14 22:50:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2022-12-14 22:50:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 22:50:28,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 22:50:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 235 states and 353 transitions. [2022-12-14 22:50:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2022-12-14 22:50:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 22:50:37,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 22:50:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 239 states and 357 transitions. [2022-12-14 22:50:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 357 transitions. [2022-12-14 22:50:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 22:50:49,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:50:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:50:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 239 states and 354 transitions. [2022-12-14 22:50:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 354 transitions. [2022-12-14 22:50:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 22:50:56,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:50:56,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:50:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:50:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 22:51:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:51:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 255 states and 376 transitions. [2022-12-14 22:51:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 376 transitions. [2022-12-14 22:51:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 22:51:20,398 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:51:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:51:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:51:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 22:51:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:51:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 256 states and 376 transitions. [2022-12-14 22:51:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2022-12-14 22:51:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 22:51:24,595 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:51:24,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:51:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:51:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 22:51:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:51:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 259 states and 378 transitions. [2022-12-14 22:51:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 378 transitions. [2022-12-14 22:51:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 22:51:33,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:51:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:51:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:51:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 22:52:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:52:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 272 states and 394 transitions. [2022-12-14 22:52:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2022-12-14 22:52:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 22:52:00,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:52:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:52:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:52:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 22:52:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:52:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 275 states and 396 transitions. [2022-12-14 22:52:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 396 transitions. [2022-12-14 22:52:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 22:52:05,240 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:52:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:52:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:52:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 88 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 22:52:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:52:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 278 states and 398 transitions. [2022-12-14 22:52:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2022-12-14 22:52:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 22:52:19,109 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:52:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:52:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:52:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 44 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:54:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:54:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 312 states and 453 transitions. [2022-12-14 22:54:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 453 transitions. [2022-12-14 22:54:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 22:54:57,498 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:54:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:54:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:55:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 43 proven. 109 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 22:55:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:55:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 316 states and 457 transitions. [2022-12-14 22:55:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 457 transitions. [2022-12-14 22:55:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 22:55:42,365 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:55:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:55:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:55:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 141 proven. 30 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 22:56:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 324 states and 465 transitions. [2022-12-14 22:56:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2022-12-14 22:56:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 22:56:10,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:10,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 141 proven. 30 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 22:56:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 330 states and 473 transitions. [2022-12-14 22:56:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 473 transitions. [2022-12-14 22:56:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 22:56:23,634 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 152 proven. 30 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 22:56:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 69 states and 68 transitions. [2022-12-14 22:56:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2022-12-14 22:56:27,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 22:56:27,927 WARN L419 CodeCheckObserver]: This Program is SAFE, Check terminated with 77 iterations. [2022-12-14 22:56:27,933 INFO L754 CodeCheckObserver]: All specifications hold 31 specifications checked. All of them hold [2022-12-14 22:56:32,181 INFO L560 CodeCheckObserver]: Invariant with dag size 3 [2022-12-14 22:56:32,189 INFO L560 CodeCheckObserver]: Invariant with dag size 95 [2022-12-14 22:56:32,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 10:56:32 ImpRootNode [2022-12-14 22:56:32,203 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 22:56:32,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 22:56:32,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 22:56:32,204 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 22:56:32,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:48:03" (3/4) ... [2022-12-14 22:56:32,206 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 22:56:32,214 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-12-14 22:56:32,214 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 22:56:32,214 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-14 22:56:32,214 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 22:56:32,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x2][x2] == 0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && unknown-#memory_int-unknown[x1][x1] == 0) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) || ((((((((((((((((((((((((!(unknown-#memory_int-unknown[x1][x1] == 0) && 4 + x0 <= unknown-#length-unknown[x0]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x2][x2] == 0)) && !(x1 == x0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(x1 == x0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && unknown-#memory_int-unknown[x0][x0] == 0) && !(x3 == x0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || ((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && unknown-#memory_int-unknown[x0][x0] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && unknown-#memory_int-unknown[x2][x2] == 0) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && unknown-#memory_int-unknown[x1][x1] == 0) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((((((((((((!(unknown-#memory_int-unknown[x1][x1] == 0) && 4 + x0 <= unknown-#length-unknown[x0]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && unknown-#memory_int-unknown[x2][x2] == 0) && !(x1 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x3][x3] == 0)) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) [2022-12-14 22:56:32,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(unknown-main_\old_#valid#1-unknown) == \valid [2022-12-14 22:56:32,240 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 22:56:32,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 22:56:32,240 INFO L158 Benchmark]: Toolchain (without parser) took 509726.82ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.1MB in the beginning and 535.4MB in the end (delta: -441.3MB). Peak memory consumption was 659.7MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,241 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 22:56:32,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.71ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 84.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.13ms. Allocated memory is still 130.0MB. Free memory was 84.7MB in the beginning and 83.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,242 INFO L158 Benchmark]: Boogie Preprocessor took 14.57ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,242 INFO L158 Benchmark]: RCFGBuilder took 325.32ms. Allocated memory is still 130.0MB. Free memory was 81.6MB in the beginning and 66.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,243 INFO L158 Benchmark]: CodeCheck took 509160.30ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.4MB in the beginning and 538.6MB in the end (delta: -472.1MB). Peak memory consumption was 991.1MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,243 INFO L158 Benchmark]: Witness Printer took 35.99ms. Allocated memory is still 1.2GB. Free memory was 537.5MB in the beginning and 535.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 22:56:32,244 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 1 procedures, 54 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 504.9s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25594 SdHoareTripleChecker+Valid, 88.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24343 mSDsluCounter, 13205 SdHoareTripleChecker+Invalid, 78.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11717 mSDsCounter, 10174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62912 IncrementalHoareTripleChecker+Invalid, 73086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10174 mSolverCounterUnsat, 1488 mSDtfsCounter, 62912 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15796 GetRequests, 13570 SyntacticMatches, 676 SemanticMatches, 1550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375051 ImplicationChecksByTransitivity, 488.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 74.1s InterpolantComputationTime, 1826 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1750 ConstructedInterpolants, 0 QuantifiedInterpolants, 28563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 52 PerfectInterpolantSequences, 1532/2052 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: \old(unknown-main_\old_#valid#1-unknown) == \valid - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x2][x2] == 0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && unknown-#memory_int-unknown[x1][x1] == 0) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) || ((((((((((((((((((((((((!(unknown-#memory_int-unknown[x1][x1] == 0) && 4 + x0 <= unknown-#length-unknown[x0]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x2][x2] == 0)) && !(x1 == x0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && !(x1 == x0)) && !(x2 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && unknown-#memory_int-unknown[x0][x0] == 0) && !(x3 == x0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || ((((((((((((((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(x3 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && unknown-#memory_int-unknown[x0][x0] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && unknown-#memory_int-unknown[x2][x2] == 0) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && unknown-#memory_int-unknown[x1][x1] == 0) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(x2 == x1)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((((((((((((!(unknown-#memory_int-unknown[x1][x1] == 0) && 4 + x0 <= unknown-#length-unknown[x0]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && 4 + x1 <= unknown-#length-unknown[x1]) && \valid[x2] == 1) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && x1 == 0) && \valid[x3] == 1) && unknown-#memory_int-unknown[x2][x2] == 0) && !(x1 == x0)) && \valid[x1] == 1) && 4 <= unknown-#length-unknown[x2]) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(x3 == x2)) && x2 == 0) && !(unknown-#memory_int-unknown[x0][x0] == 0)) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int))))) || (((((((((((((4 + x0 <= unknown-#length-unknown[x0] && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 0 == x3) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && 4 + x3 <= unknown-#length-unknown[x3]) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[x0] == 1) && \valid[x3] == 1) && !(unknown-#memory_int-unknown[x3][x3] == 0)) && x0 == 0) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && \valid[__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0][__builtin_alloca(sizeof(int)) := 0] == \old(unknown-main_\old_#valid#1-unknown)) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) && !(__builtin_alloca(sizeof(int)) == __builtin_alloca(sizeof(int)))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.71ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 84.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.13ms. Allocated memory is still 130.0MB. Free memory was 84.7MB in the beginning and 83.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.57ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.32ms. Allocated memory is still 130.0MB. Free memory was 81.6MB in the beginning and 66.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * CodeCheck took 509160.30ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.4MB in the beginning and 538.6MB in the end (delta: -472.1MB). Peak memory consumption was 991.1MB. Max. memory is 16.1GB. * Witness Printer took 35.99ms. Allocated memory is still 1.2GB. Free memory was 537.5MB in the beginning and 535.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2022-12-14 22:56:32,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a339a971-3a85-4bd8-a5a5-e650956e2fae/bin/ukojak-rkRKPMF4O4/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