./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:26:35,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:26:35,200 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:26:35,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:26:35,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:26:35,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:26:35,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:26:35,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:26:35,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:26:35,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:26:35,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:26:35,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:26:35,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:26:35,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:26:35,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:26:35,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:26:35,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:26:35,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:26:35,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:26:35,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:26:35,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:26:35,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:26:35,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:26:35,236 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:26:35,237 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:26:35,237 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:26:35,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:26:35,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:26:35,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:26:35,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:26:35,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:26:35,239 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:26:35,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:26:35,241 INFO L153 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_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/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_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 [2024-11-08 19:26:35,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:26:35,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:26:35,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:26:35,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:26:35,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:26:35,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/reducercommutativity/rangesum05.i Unable to find full path for "g++" [2024-11-08 19:26:37,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:26:37,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:26:37,784 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/sv-benchmarks/c/reducercommutativity/rangesum05.i [2024-11-08 19:26:37,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/data/8c95f9136/f657a5e56b524dafb03fe68037425dfe/FLAG06836a96a [2024-11-08 19:26:37,814 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/data/8c95f9136/f657a5e56b524dafb03fe68037425dfe [2024-11-08 19:26:37,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:26:37,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:26:37,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:26:37,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:26:37,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:26:37,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:26:37" (1/1) ... [2024-11-08 19:26:37,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd42986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:37, skipping insertion in model container [2024-11-08 19:26:37,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:26:37" (1/1) ... [2024-11-08 19:26:37,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:26:38,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-11-08 19:26:38,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:26:38,095 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:26:38,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-11-08 19:26:38,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:26:38,153 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:26:38,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38 WrapperNode [2024-11-08 19:26:38,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:26:38,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:26:38,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:26:38,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:26:38,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,198 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-08 19:26:38,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:26:38,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:26:38,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:26:38,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:26:38,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:26:38,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:26:38,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:26:38,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:26:38,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:26:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:26:38,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:26:38,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:26:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:26:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:26:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:26:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:26:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:26:38,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:26:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:26:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-08 19:26:38,317 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-08 19:26:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:26:38,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:26:38,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:26:38,705 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 19:26:38,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:26:38,788 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:26:38,788 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:26:38,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:26:38 BoogieIcfgContainer [2024-11-08 19:26:38,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:26:38,791 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:26:38,791 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:26:38,820 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:26:38,821 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:26:38" (1/1) ... [2024-11-08 19:26:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:26:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2024-11-08 19:26:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-08 19:26:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:26:38,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:26:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 24 states and 32 transitions. [2024-11-08 19:26:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-08 19:26:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:26:39,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:26:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 25 states and 33 transitions. [2024-11-08 19:26:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-08 19:26:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:39,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:26:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 26 states and 35 transitions. [2024-11-08 19:26:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-08 19:26:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:26:39,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 19:26:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 26 states and 34 transitions. [2024-11-08 19:26:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-08 19:26:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:26:39,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:26:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 27 states and 36 transitions. [2024-11-08 19:26:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-08 19:26:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:26:39,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:26:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2024-11-08 19:26:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-08 19:26:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:26:40,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:26:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-11-08 19:26:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-08 19:26:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:26:40,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:26:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 29 states and 38 transitions. [2024-11-08 19:26:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-08 19:26:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:26:40,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-11-08 19:26:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-11-08 19:26:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:26:40,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2024-11-08 19:26:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-08 19:26:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:26:40,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 32 states and 43 transitions. [2024-11-08 19:26:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-08 19:26:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 19:26:40,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 19:26:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2024-11-08 19:26:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-08 19:26:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:26:41,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-11-08 19:26:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-08 19:26:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 19:26:41,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-08 19:26:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-08 19:26:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 19:26:41,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:26:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 38 states and 47 transitions. [2024-11-08 19:26:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-08 19:26:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 19:26:42,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 19:26:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 40 states and 49 transitions. [2024-11-08 19:26:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2024-11-08 19:26:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 19:26:42,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 19:26:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-11-08 19:26:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-08 19:26:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 19:26:42,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-08 19:26:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 44 states and 52 transitions. [2024-11-08 19:26:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-08 19:26:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 19:26:43,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 19:26:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 46 states and 54 transitions. [2024-11-08 19:26:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-08 19:26:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 19:26:43,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 19:26:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 48 states and 55 transitions. [2024-11-08 19:26:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-08 19:26:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 19:26:43,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:26:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:26:44,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:26:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:26:44,928 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2024-11-08 19:26:45,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:26:45 ImpRootNode [2024-11-08 19:26:45,025 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:26:45,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:26:45,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:26:45,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:26:45,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:26:38" (3/4) ... [2024-11-08 19:26:45,027 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:26:45,152 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:26:45,152 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:26:45,153 INFO L158 Benchmark]: Toolchain (without parser) took 7333.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 127.3MB in the beginning and 205.5MB in the end (delta: -78.2MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,153 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:26:45,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.07ms. Allocated memory is still 165.7MB. Free memory was 126.9MB in the beginning and 114.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,155 INFO L158 Benchmark]: Boogie Preprocessor took 38.45ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,156 INFO L158 Benchmark]: RCFGBuilder took 551.23ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 95.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,156 INFO L158 Benchmark]: CodeCheck took 6234.25ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 95.5MB in the beginning and 56.8MB in the end (delta: 38.7MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,157 INFO L158 Benchmark]: Witness Printer took 126.97ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 56.8MB in the beginning and 205.5MB in the end (delta: -148.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:26:45,158 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 21, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1231 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 460 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 460 mSDtfsCounter, 1428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4157 GetRequests, 4061 SyntacticMatches, 30 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 1395/1675 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 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={4:0}] [L17] COND FALSE !(i < 5) VAL [i=0, x={4:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={4:0}] [L17] COND FALSE !(i < 5) VAL [i=1, x={4:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={4:0}] [L17] COND FALSE !(i < 5) VAL [i=2, x={4:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={4:0}] [L17] COND FALSE !(i < 5) VAL [i=3, x={4:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={4:0}] [L17] COND FALSE !(i < 5) VAL [i=4, x={4:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={4:0}] [L17] COND TRUE i < 5 VAL [x={4:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={4:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=4, ret=4, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=1, i=4, ret=4, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=5, ret=5, x={4:0}] [L28] COND TRUE i < 5 VAL [\old(x)={4:0}, cnt=2, ret=5, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L49] RET, EXPR rangesum(x) VAL [x={4:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=2, x={4:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=4, ret=4, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=1, i=4, ret=4, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=5, ret=5, x={4:0}] [L28] COND TRUE i < 5 VAL [\old(x)={4:0}, cnt=2, ret=5, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=2, x={4:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND FALSE !(i<5 -1) VAL [i=0, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND FALSE !(i<5 -1) VAL [i=1, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND FALSE !(i<5 -1) VAL [i=2, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND FALSE !(i<5 -1) VAL [i=3, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=2, ret=2, temp=2, x={4:0}] [L54] COND TRUE i<5 -1 VAL [ret2=2, ret=2, temp=2, x={4:0}] [L57] x[5 -1] = temp VAL [ret2=2, ret=2, x={4:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND FALSE !(i > 5/2) [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=4, ret=1, x={4:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={4:0}, cnt=1, i=4, ret=1, x={4:0}] [L28] COND TRUE i < 5 [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=5, ret=3, x={4:0}] [L28] COND TRUE i < 5 VAL [\old(x)={4:0}, cnt=2, ret=3, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=2, ret=2, x={4:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={4:0}] [L61] reach_error() VAL [x={4:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.07ms. Allocated memory is still 165.7MB. Free memory was 126.9MB in the beginning and 114.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.45ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.23ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 95.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * CodeCheck took 6234.25ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 95.5MB in the beginning and 56.8MB in the end (delta: 38.7MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 126.97ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 56.8MB in the beginning and 205.5MB in the end (delta: -148.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:26:45,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e6f270-29a0-4873-a63f-16b2f1dd79f0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE