./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46a7ff4188c2c3bafb15fa2cd18d09e96971932e8eae948280cc4b8fb8a2f5fb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:47:32,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:47:32,518 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:47:32,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:47:32,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:47:32,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:47:32,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:47:32,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:47:32,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:47:32,553 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:47:32,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:47:32,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:47:32,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:47:32,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:47:32,571 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:47:32,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:47:32,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:47:32,573 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:47:32,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:47:32,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:47:32,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:47:32,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:47:32,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:47:32,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:47:32,576 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:47:32,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:47:32,577 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:47:32,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:47:32,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:47:32,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:47:32,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:47:32,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:32,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:47:32,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:47:32,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:47:32,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:47:32,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:47:32,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:47:32,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:47:32,580 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:47:32,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:47:32,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:47:32,581 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_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/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_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme 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 -> 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 -> 46a7ff4188c2c3bafb15fa2cd18d09e96971932e8eae948280cc4b8fb8a2f5fb [2023-11-26 10:47:32,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:47:32,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:47:32,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:47:32,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:47:32,883 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:47:32,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-26 10:47:35,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:47:36,270 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:47:36,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-26 10:47:36,282 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/data/b2e81949d/aa6609ecf02f446285d5162b23352af5/FLAG5b398cf62 [2023-11-26 10:47:36,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/data/b2e81949d/aa6609ecf02f446285d5162b23352af5 [2023-11-26 10:47:36,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:47:36,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:47:36,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:36,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:47:36,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:47:36,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b30f586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36, skipping insertion in model container [2023-11-26 10:47:36,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:47:36,570 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_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-11-26 10:47:36,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:36,671 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:47:36,683 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_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-11-26 10:47:36,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:36,741 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:47:36,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36 WrapperNode [2023-11-26 10:47:36,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:36,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:36,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:47:36,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:47:36,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,829 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-11-26 10:47:36,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:36,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:47:36,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:47:36,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:47:36,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,888 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 10:47:36,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:47:36,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:47:36,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:47:36,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:47:36,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (1/1) ... [2023-11-26 10:47:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:47:36,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:47:36,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:47:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:47:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:47:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:47:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:47:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:47:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:47:37,093 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:47:37,095 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:47:37,432 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:47:37,528 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:47:37,528 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:47:37,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:37 BoogieIcfgContainer [2023-11-26 10:47:37,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:47:37,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:47:37,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:47:37,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:47:37,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:47:36" (1/3) ... [2023-11-26 10:47:37,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4fd4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:37, skipping insertion in model container [2023-11-26 10:47:37,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:36" (2/3) ... [2023-11-26 10:47:37,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4fd4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:37, skipping insertion in model container [2023-11-26 10:47:37,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:37" (3/3) ... [2023-11-26 10:47:37,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-26 10:47:37,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:47:37,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:47:37,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:47:37,647 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=LoopHeads, 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;@455ac8c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:47:37,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:47:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 10:47:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-26 10:47:37,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:37,666 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:37,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:37,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash 379498785, now seen corresponding path program 1 times [2023-11-26 10:47:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381033813] [2023-11-26 10:47:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 10:47:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381033813] [2023-11-26 10:47:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381033813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:47:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483706] [2023-11-26 10:47:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:38,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:47:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:47:38,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:47:38,181 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 10:47:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:38,249 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2023-11-26 10:47:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:47:38,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2023-11-26 10:47:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:38,260 INFO L225 Difference]: With dead ends: 79 [2023-11-26 10:47:38,261 INFO L226 Difference]: Without dead ends: 38 [2023-11-26 10:47:38,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-26 10:47:38,273 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:38,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-26 10:47:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-26 10:47:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 10:47:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-11-26 10:47:38,333 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 96 [2023-11-26 10:47:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:38,333 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-11-26 10:47:38,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 10:47:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-11-26 10:47:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-26 10:47:38,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:38,340 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:47:38,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:38,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash -923545311, now seen corresponding path program 1 times [2023-11-26 10:47:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240838584] [2023-11-26 10:47:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 10:47:38,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240838584] [2023-11-26 10:47:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240838584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:38,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:38,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427315745] [2023-11-26 10:47:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:38,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:38,664 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:38,749 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2023-11-26 10:47:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-11-26 10:47:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:38,756 INFO L225 Difference]: With dead ends: 104 [2023-11-26 10:47:38,758 INFO L226 Difference]: Without dead ends: 67 [2023-11-26 10:47:38,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-26 10:47:38,761 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:38,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-26 10:47:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2023-11-26 10:47:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 10:47:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2023-11-26 10:47:38,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 96 [2023-11-26 10:47:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:38,794 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2023-11-26 10:47:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2023-11-26 10:47:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-26 10:47:38,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:38,806 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:38,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:47:38,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:38,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash -921698269, now seen corresponding path program 1 times [2023-11-26 10:47:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954127252] [2023-11-26 10:47:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 10:47:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954127252] [2023-11-26 10:47:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954127252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336910944] [2023-11-26 10:47:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:39,310 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:39,351 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2023-11-26 10:47:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:39,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-11-26 10:47:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:39,354 INFO L225 Difference]: With dead ends: 75 [2023-11-26 10:47:39,354 INFO L226 Difference]: Without dead ends: 38 [2023-11-26 10:47:39,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-26 10:47:39,356 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:39,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-26 10:47:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-26 10:47:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 10:47:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-11-26 10:47:39,370 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 96 [2023-11-26 10:47:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:39,371 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-11-26 10:47:39,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-11-26 10:47:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-26 10:47:39,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:39,374 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:39,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:47:39,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:39,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash -921638687, now seen corresponding path program 1 times [2023-11-26 10:47:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:39,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382513783] [2023-11-26 10:47:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 10:47:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382513783] [2023-11-26 10:47:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382513783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:47:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799984429] [2023-11-26 10:47:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:45,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:47:45,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:45,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:47:45,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:47:45,876 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:46,127 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-11-26 10:47:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:47:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-11-26 10:47:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:46,129 INFO L225 Difference]: With dead ends: 62 [2023-11-26 10:47:46,129 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 10:47:46,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:47:46,140 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:46,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 265 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:47:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 10:47:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 10:47:46,142 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-26 10:47:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 10:47:46,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-11-26 10:47:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:46,142 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 10:47:46,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 10:47:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 10:47:46,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 10:47:46,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:47:46,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:47:46,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 10:47:46,447 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-26 10:47:46,447 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,447 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,447 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 10:47:46,448 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 10:47:46,448 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,448 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,448 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 10:47:46,448 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-11-26 10:47:46,448 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-26 10:47:46,449 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,449 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,449 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-26 10:47:46,449 INFO L895 garLoopResultBuilder]: At program point L94-3(lines 94 100) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,449 INFO L899 garLoopResultBuilder]: For program point L94-4(lines 94 100) no Hoare annotation was computed. [2023-11-26 10:47:46,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 10:47:46,450 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-11-26 10:47:46,450 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,450 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,450 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-26 10:47:46,450 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,451 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 10:47:46,451 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-26 10:47:46,451 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,451 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 10:47:46,451 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-26 10:47:46,452 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,452 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,452 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-11-26 10:47:46,452 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-26 10:47:46,452 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-26 10:47:46,452 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-11-26 10:47:46,453 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,453 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-26 10:47:46,453 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 10:47:46,453 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 10:47:46,453 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 10:47:46,458 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 10:47:46,461 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 10:47:46,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:47:46,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:47:46 BoogieIcfgContainer [2023-11-26 10:47:46,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:47:46,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:47:46,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:47:46,481 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:47:46,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:37" (3/4) ... [2023-11-26 10:47:46,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:47:46,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 10:47:46,496 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-26 10:47:46,496 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-26 10:47:46,497 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:47:46,497 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:47:46,599 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:47:46,599 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:47:46,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:47:46,600 INFO L158 Benchmark]: Toolchain (without parser) took 10293.25ms. Allocated memory was 134.2MB in the beginning and 331.4MB in the end (delta: 197.1MB). Free memory was 87.6MB in the beginning and 279.2MB in the end (delta: -191.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,601 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:47:46,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.26ms. Allocated memory is still 134.2MB. Free memory was 87.6MB in the beginning and 74.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.56ms. Allocated memory is still 134.2MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,602 INFO L158 Benchmark]: Boogie Preprocessor took 90.82ms. Allocated memory is still 134.2MB. Free memory was 70.4MB in the beginning and 63.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,602 INFO L158 Benchmark]: RCFGBuilder took 606.73ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 97.6MB in the end (delta: -34.4MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,603 INFO L158 Benchmark]: TraceAbstraction took 8949.31ms. Allocated memory was 134.2MB in the beginning and 331.4MB in the end (delta: 197.1MB). Free memory was 97.0MB in the beginning and 285.5MB in the end (delta: -188.5MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,603 INFO L158 Benchmark]: Witness Printer took 118.55ms. Allocated memory is still 331.4MB. Free memory was 285.5MB in the beginning and 279.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:47:46,606 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.28ms. Allocated memory is still 134.2MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.26ms. Allocated memory is still 134.2MB. Free memory was 87.6MB in the beginning and 74.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.56ms. Allocated memory is still 134.2MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.82ms. Allocated memory is still 134.2MB. Free memory was 70.4MB in the beginning and 63.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 606.73ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 97.6MB in the end (delta: -34.4MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8949.31ms. Allocated memory was 134.2MB in the beginning and 331.4MB in the end (delta: 197.1MB). Free memory was 97.0MB in the beginning and 285.5MB in the end (delta: -188.5MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. * Witness Printer took 118.55ms. Allocated memory is still 331.4MB. Free memory was 285.5MB in the beginning and 279.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 8.8s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 265 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 91 PreInvPairs, 119 NumberOfFragments, 154 HoareAnnotationTreeSize, 91 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 627 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 94]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-11-26 10:47:46,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a9b1a6-f0c9-49b1-a4cf-46629439aef7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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