./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f033dd84d624e05e9253cecaeb57f3610862313c5f7c277342ceadc0552d051 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:01:48,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:01:48,231 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:01:48,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:01:48,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:01:48,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:01:48,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:01:48,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:01:48,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:01:48,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:01:48,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:01:48,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:01:48,287 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:01:48,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:01:48,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:01:48,289 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:01:48,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:01:48,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:01:48,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:01:48,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:01:48,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:01:48,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:01:48,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:01:48,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:01:48,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:01:48,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:01:48,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:01:48,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:01:48,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:48,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:01:48,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:01:48,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:01:48,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:01:48,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:01:48,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:01:48,299 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:01:48,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:01:48,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:01:48,300 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:01:48,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/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_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f033dd84d624e05e9253cecaeb57f3610862313c5f7c277342ceadc0552d051 [2023-11-06 22:01:48,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:01:48,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:01:48,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:01:48,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:01:48,694 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:01:48,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i [2023-11-06 22:01:51,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:01:52,071 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:01:52,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i [2023-11-06 22:01:52,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/data/b998bc6e8/cf4c317504f645dd9050aae2a734ea4c/FLAG106305624 [2023-11-06 22:01:52,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/data/b998bc6e8/cf4c317504f645dd9050aae2a734ea4c [2023-11-06 22:01:52,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:01:52,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:01:52,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:52,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:01:52,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:01:52,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4d412c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52, skipping insertion in model container [2023-11-06 22:01:52,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:01:52,323 WARN L240 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_c3842814-f180-4134-961e-6b6e4f22ce50/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i[917,930] [2023-11-06 22:01:52,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:52,379 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:01:52,393 WARN L240 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_c3842814-f180-4134-961e-6b6e4f22ce50/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-62.i[917,930] [2023-11-06 22:01:52,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:52,434 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:01:52,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52 WrapperNode [2023-11-06 22:01:52,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:52,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:52,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:01:52,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:01:52,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,483 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2023-11-06 22:01:52,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:52,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:01:52,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:01:52,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:01:52,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:01:52,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:01:52,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:01:52,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:01:52,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (1/1) ... [2023-11-06 22:01:52,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:52,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:01:52,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:01:52,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:01:52,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:01:52,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:01:52,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:01:52,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:01:52,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:01:52,743 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:01:52,745 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:01:52,985 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:01:52,992 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:01:52,992 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:01:52,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:52 BoogieIcfgContainer [2023-11-06 22:01:52,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:01:52,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:01:52,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:01:53,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:01:53,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:52" (1/3) ... [2023-11-06 22:01:53,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d951333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:53, skipping insertion in model container [2023-11-06 22:01:53,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:52" (2/3) ... [2023-11-06 22:01:53,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d951333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:53, skipping insertion in model container [2023-11-06 22:01:53,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:52" (3/3) ... [2023-11-06 22:01:53,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-62.i [2023-11-06 22:01:53,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:01:53,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:01:53,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:01:53,081 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3272f847, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:01:53,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:01:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:01:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:01:53,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:53,095 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:53,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:53,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -546360006, now seen corresponding path program 1 times [2023-11-06 22:01:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427706124] [2023-11-06 22:01:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:01:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:01:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:01:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:01:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:01:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:01:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:01:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:01:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:01:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427706124] [2023-11-06 22:01:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427706124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:01:53,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754858820] [2023-11-06 22:01:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:53,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:01:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:01:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:01:53,474 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:01:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:53,501 INFO L93 Difference]: Finished difference Result 73 states and 116 transitions. [2023-11-06 22:01:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:01:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2023-11-06 22:01:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:53,511 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:01:53,511 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:01:53,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:01:53,519 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:53,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:01:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:01:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:01:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-11-06 22:01:53,561 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 58 [2023-11-06 22:01:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:53,562 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-11-06 22:01:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:01:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-11-06 22:01:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:01:53,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:53,566 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:53,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:01:53,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:53,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash 103720250, now seen corresponding path program 1 times [2023-11-06 22:01:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50616397] [2023-11-06 22:01:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:02:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50616397] [2023-11-06 22:02:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50616397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:00,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:00,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:02:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273237734] [2023-11-06 22:02:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:02:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:02:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:00,174 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:02,042 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2023-11-06 22:02:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:02:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2023-11-06 22:02:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:02,045 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:02:02,045 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:02:02,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:02:02,047 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:02,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 326 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:02:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:02:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2023-11-06 22:02:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:02:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-11-06 22:02:02,064 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 58 [2023-11-06 22:02:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:02,065 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-11-06 22:02:02,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-11-06 22:02:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:02:02,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:02,068 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:02,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:02:02,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:02,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash 21009008, now seen corresponding path program 1 times [2023-11-06 22:02:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:02,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173992583] [2023-11-06 22:02:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:02:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173992583] [2023-11-06 22:02:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173992583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612300097] [2023-11-06 22:02:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:02,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:02,157 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:02,194 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2023-11-06 22:02:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2023-11-06 22:02:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:02,197 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:02:02,197 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 22:02:02,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:02,200 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:02,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 22:02:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2023-11-06 22:02:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:02:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2023-11-06 22:02:02,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 60 [2023-11-06 22:02:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:02,214 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2023-11-06 22:02:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2023-11-06 22:02:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:02:02,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:02,217 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:02,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:02:02,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:02,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1796016370, now seen corresponding path program 1 times [2023-11-06 22:02:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629575313] [2023-11-06 22:02:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:02:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629575313] [2023-11-06 22:02:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629575313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:02,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36432575] [2023-11-06 22:02:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:02,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:02,349 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:02,423 INFO L93 Difference]: Finished difference Result 96 states and 135 transitions. [2023-11-06 22:02:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2023-11-06 22:02:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:02,426 INFO L225 Difference]: With dead ends: 96 [2023-11-06 22:02:02,426 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:02:02,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:02,429 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:02,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:02:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:02:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:02:02,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2023-11-06 22:02:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:02,433 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:02:02,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:02:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:02:02,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:02:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:02:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:02:02,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:02:02,844 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:02:02,844 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:02:02,844 INFO L899 garLoopResultBuilder]: For program point L81(lines 69 82) no Hoare annotation was computed. [2023-11-06 22:02:02,845 INFO L902 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: true [2023-11-06 22:02:02,845 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-06 22:02:02,845 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-06 22:02:02,845 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-11-06 22:02:02,845 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 92 103) the Hoare annotation is: false [2023-11-06 22:02:02,846 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 52) no Hoare annotation was computed. [2023-11-06 22:02:02,846 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 52) no Hoare annotation was computed. [2023-11-06 22:02:02,846 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:02:02,846 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 67) no Hoare annotation was computed. [2023-11-06 22:02:02,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:02:02,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:02:02,847 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-06 22:02:02,848 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 88 91) the Hoare annotation is: (let ((.cse2 (* 256 (div ~var_1_6~0 256)))) (let ((.cse0 (let ((.cse14 (* 65536 (div ~var_1_7~0 65536)))) (or (and (= (+ 65536 .cse14 ~var_1_10~0) ~var_1_7~0) (<= (+ .cse14 32768) ~var_1_7~0)) (and (<= ~var_1_7~0 (+ 32767 .cse14)) (= (+ .cse14 ~var_1_10~0) ~var_1_7~0))))) (.cse1 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse5 (= 14 ~var_1_1~0)) (.cse6 (= (+ ~var_1_7~0 ~var_1_6~0 ~last_1_var_1_1~0) (+ .cse2 ~var_1_8~0))) (.cse4 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (.cse7 (= ~var_1_9~0 ~var_1_8~0)) (.cse3 (+ ~var_1_4~0 1))) (or (and .cse0 .cse1 (or (= (+ .cse2 ~var_1_5~0) (+ ~var_1_6~0 (* (div ~var_1_5~0 256) 256))) (< ~var_1_9~0 .cse3) (= 14 ~var_1_4~0)) (not .cse4) .cse5 .cse6 (= ~var_1_2~0 4) .cse7) (let ((.cse13 (* 256 (div ~var_1_4~0 256))) (.cse8 (* (div (* (- 1) ~var_1_4~0) 256) 256))) (let ((.cse11 (= (+ 256 .cse8 ~var_1_4~0 ~var_1_2~0) 0)) (.cse9 (< ~var_1_4~0 0)) (.cse10 (+ .cse13 127))) (and .cse0 .cse1 .cse5 .cse6 (or (and (<= (+ .cse8 ~var_1_4~0 128) 0) (or .cse9 (< .cse10 ~var_1_4~0))) (not .cse11)) .cse4 .cse7 (or .cse11 (let ((.cse12 (= (+ 256 .cse13 ~var_1_2~0) ~var_1_4~0))) (and (or (not .cse12) (and (<= 0 ~var_1_4~0) (<= (+ .cse13 128) ~var_1_4~0))) (or (and (or (and (= (+ .cse8 ~var_1_4~0 ~var_1_2~0) 0) (<= 0 (+ .cse8 ~var_1_4~0 127))) (< 0 .cse3)) (or .cse9 (and (<= ~var_1_4~0 .cse10) (= (+ .cse13 ~var_1_2~0) ~var_1_4~0)))) .cse12)))))))))) [2023-11-06 22:02:02,849 INFO L902 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: true [2023-11-06 22:02:02,849 INFO L902 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: true [2023-11-06 22:02:02,849 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2023-11-06 22:02:02,849 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 68) no Hoare annotation was computed. [2023-11-06 22:02:02,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:02:02,850 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-11-06 22:02:02,850 INFO L902 garLoopResultBuilder]: At program point L95-2(lines 95 101) the Hoare annotation is: true [2023-11-06 22:02:02,850 INFO L899 garLoopResultBuilder]: For program point L95-3(lines 95 101) no Hoare annotation was computed. [2023-11-06 22:02:02,850 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2023-11-06 22:02:02,850 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:02:02,851 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:02:02,851 INFO L902 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2023-11-06 22:02:02,851 INFO L902 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: true [2023-11-06 22:02:02,851 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2023-11-06 22:02:02,851 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-11-06 22:02:02,852 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 55 59) no Hoare annotation was computed. [2023-11-06 22:02:02,852 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-06 22:02:02,852 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-06 22:02:02,852 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-06 22:02:02,852 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2023-11-06 22:02:02,853 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:02:02,853 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:02:02,853 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:02:02,853 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:02:02,857 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:02:02,859 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:02:02,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:02:02 BoogieIcfgContainer [2023-11-06 22:02:02,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:02:02,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:02:02,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:02:02,907 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:02:02,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:52" (3/4) ... [2023-11-06 22:02:02,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:02:02,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:02:02,924 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:02:02,925 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:02:02,925 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:02:02,926 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:02:02,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (((((256 * (var_1_6 / 256)) + var_1_5) == (var_1_6 + ((var_1_5 / 256) * 256))) || (var_1_9 < (var_1_4 + 1))) || (14 == var_1_4))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && (var_1_2 == 4)) && (var_1_9 == var_1_8)) || ((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && ((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + 128) <= 0) && ((var_1_4 < 0) || (((256 * (var_1_4 / 256)) + 127) < var_1_4))) || !(((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && (var_1_9 == var_1_8)) && (((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0) || ((!((((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)) || ((0 <= var_1_4) && (((256 * (var_1_4 / 256)) + 128) <= var_1_4))) && ((((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + var_1_2) == 0) && (0 <= (((((-1 * var_1_4) / 256) * 256) + var_1_4) + 127))) || (0 < (var_1_4 + 1))) && ((var_1_4 < 0) || ((var_1_4 <= ((256 * (var_1_4 / 256)) + 127)) && (((256 * (var_1_4 / 256)) + var_1_2) == var_1_4)))) || (((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)))))) [2023-11-06 22:02:02,997 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (((((256 * (var_1_6 / 256)) + var_1_5) == (var_1_6 + ((var_1_5 / 256) * 256))) || (var_1_9 < (var_1_4 + 1))) || (14 == var_1_4))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && (var_1_2 == 4)) && (var_1_9 == var_1_8)) || ((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && ((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + 128) <= 0) && ((var_1_4 < 0) || (((256 * (var_1_4 / 256)) + 127) < var_1_4))) || !(((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && (var_1_9 == var_1_8)) && (((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0) || ((!((((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)) || ((0 <= var_1_4) && (((256 * (var_1_4 / 256)) + 128) <= var_1_4))) && ((((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + var_1_2) == 0) && (0 <= (((((-1 * var_1_4) / 256) * 256) + var_1_4) + 127))) || (0 < (var_1_4 + 1))) && ((var_1_4 < 0) || ((var_1_4 <= ((256 * (var_1_4 / 256)) + 127)) && (((256 * (var_1_4 / 256)) + var_1_2) == var_1_4)))) || (((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)))))) [2023-11-06 22:02:03,009 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:02:03,009 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:02:03,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:02:03,010 INFO L158 Benchmark]: Toolchain (without parser) took 10907.94ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.3MB in the beginning and 148.6MB in the end (delta: -9.3MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,011 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 127.9MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:03,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.13ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 130.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.23ms. Allocated memory is still 169.9MB. Free memory was 130.2MB in the beginning and 128.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,013 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 127.4MB in the end (delta: 814.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:03,014 INFO L158 Benchmark]: RCFGBuilder took 477.88ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 126.6MB in the end (delta: 788.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,014 INFO L158 Benchmark]: TraceAbstraction took 9908.72ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 125.3MB in the beginning and 152.9MB in the end (delta: -27.5MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,015 INFO L158 Benchmark]: Witness Printer took 103.55ms. Allocated memory is still 247.5MB. Free memory was 152.9MB in the beginning and 148.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:02:03,019 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 127.9MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.13ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 130.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.23ms. Allocated memory is still 169.9MB. Free memory was 130.2MB in the beginning and 128.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 127.4MB in the end (delta: 814.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 477.88ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 126.6MB in the end (delta: 788.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9908.72ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 125.3MB in the beginning and 152.9MB in the end (delta: -27.5MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Witness Printer took 103.55ms. Allocated memory is still 247.5MB. Free memory was 152.9MB in the beginning and 148.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 572 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 208 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 44 PreInvPairs, 55 NumberOfFragments, 326 HoareAnnotationTreeSize, 44 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 164 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 1035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 448/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: (((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (((((256 * (var_1_6 / 256)) + var_1_5) == (var_1_6 + ((var_1_5 / 256) * 256))) || (var_1_9 < (var_1_4 + 1))) || (14 == var_1_4))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && (var_1_2 == 4)) && (var_1_9 == var_1_8)) || ((((((((((((65536 + (65536 * (var_1_7 / 65536))) + var_1_10) == var_1_7) && (((65536 * (var_1_7 / 65536)) + 32768) <= var_1_7)) || ((var_1_7 <= (32767 + (65536 * (var_1_7 / 65536)))) && (((65536 * (var_1_7 / 65536)) + var_1_10) == var_1_7))) && (1 <= \result)) && (14 == var_1_1)) && (((var_1_7 + var_1_6) + last_1_var_1_1) == ((256 * (var_1_6 / 256)) + var_1_8))) && ((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + 128) <= 0) && ((var_1_4 < 0) || (((256 * (var_1_4 / 256)) + 127) < var_1_4))) || !(((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && (var_1_9 == var_1_8)) && (((((256 + (((-1 * var_1_4) / 256) * 256)) + var_1_4) + var_1_2) == 0) || ((!((((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)) || ((0 <= var_1_4) && (((256 * (var_1_4 / 256)) + 128) <= var_1_4))) && ((((((((((-1 * var_1_4) / 256) * 256) + var_1_4) + var_1_2) == 0) && (0 <= (((((-1 * var_1_4) / 256) * 256) + var_1_4) + 127))) || (0 < (var_1_4 + 1))) && ((var_1_4 < 0) || ((var_1_4 <= ((256 * (var_1_4 / 256)) + 127)) && (((256 * (var_1_4 / 256)) + var_1_2) == var_1_4)))) || (((256 + (256 * (var_1_4 / 256))) + var_1_2) == var_1_4)))))) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 22:02:03,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3842814-f180-4134-961e-6b6e4f22ce50/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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