./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd --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 b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:00:16,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:00:16,806 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:00:16,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:00:16,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:00:16,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:00:16,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:00:16,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:00:16,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:00:16,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:00:16,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:00:16,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:00:16,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:00:16,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:00:16,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:00:16,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:00:16,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:00:16,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:00:16,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:00:16,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:00:16,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:00:16,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:00:16,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:00:16,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:00:16,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:00:16,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:00:16,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:16,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:00:16,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:00:16,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:00:16,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:00:16,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd 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 -> b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 [2024-11-13 13:00:17,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:00:17,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:00:17,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:00:17,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:00:17,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:00:17,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i Unable to find full path for "g++" [2024-11-13 13:00:19,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:00:19,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:00:19,991 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i [2024-11-13 13:00:20,000 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/data/e38ad75dc/680e601d5d8f4630ac95a558b1542bd0/FLAG24e731482 [2024-11-13 13:00:20,019 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/data/e38ad75dc/680e601d5d8f4630ac95a558b1542bd0 [2024-11-13 13:00:20,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:00:20,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:00:20,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:20,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:00:20,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:00:20,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1a8e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20, skipping insertion in model container [2024-11-13 13:00:20,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:00:20,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i[915,928] [2024-11-13 13:00:20,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:20,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:00:20,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i[915,928] [2024-11-13 13:00:20,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:20,464 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:00:20,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20 WrapperNode [2024-11-13 13:00:20,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:20,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:20,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:00:20,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:00:20,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,549 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-13 13:00:20,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:20,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:00:20,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:00:20,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:00:20,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,615 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]. [2024-11-13 13:00:20,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:00:20,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:00:20,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:00:20,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:00:20,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (1/1) ... [2024-11-13 13:00:20,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:20,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:20,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:20,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:00:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:00:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:00:20,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:00:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:00:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:00:20,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:00:20,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:00:20,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:00:21,221 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 13:00:21,221 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:00:21,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:00:21,234 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:00:21,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:21 BoogieIcfgContainer [2024-11-13 13:00:21,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:00:21,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:00:21,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:00:21,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:00:21,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:00:20" (1/3) ... [2024-11-13 13:00:21,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8d6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:21, skipping insertion in model container [2024-11-13 13:00:21,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:20" (2/3) ... [2024-11-13 13:00:21,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8d6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:21, skipping insertion in model container [2024-11-13 13:00:21,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:21" (3/3) ... [2024-11-13 13:00:21,245 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-27.i [2024-11-13 13:00:21,263 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:00:21,264 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-27.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:00:21,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:00:21,346 INFO L333 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, 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;@253ea29c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:00:21,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:00:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-13 13:00:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:00:21,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:21,363 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:21,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1460636445, now seen corresponding path program 1 times [2024-11-13 13:00:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008639539] [2024-11-13 13:00:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:00:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:00:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:00:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:00:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:00:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:00:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:00:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:00:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 13:00:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:00:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:00:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:00:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:00:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:00:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:00:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 13:00:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:00:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 13:00:21,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008639539] [2024-11-13 13:00:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008639539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:21,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:00:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639744875] [2024-11-13 13:00:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:00:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:00:21,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:00:21,917 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-13 13:00:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:21,957 INFO L93 Difference]: Finished difference Result 93 states and 157 transitions. [2024-11-13 13:00:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:00:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-13 13:00:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:21,967 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:00:21,967 INFO L226 Difference]: Without dead ends: 46 [2024-11-13 13:00:21,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:00:21,975 INFO L432 NwaCegarLoop]: 66 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, 66 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 [2024-11-13 13:00:21,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-13 13:00:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-13 13:00:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-13 13:00:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-13 13:00:22,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 107 [2024-11-13 13:00:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:22,051 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-13 13:00:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-13 13:00:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-13 13:00:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:00:22,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:22,060 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:22,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:00:22,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:22,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1590976027, now seen corresponding path program 1 times [2024-11-13 13:00:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:22,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341522244] [2024-11-13 13:00:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:00:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:00:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:00:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:00:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:00:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:00:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:00:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:00:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 13:00:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:00:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:00:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:00:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:00:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:00:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:00:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 13:00:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:00:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 13:00:27,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341522244] [2024-11-13 13:00:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341522244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:00:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890626387] [2024-11-13 13:00:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:27,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:00:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:00:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:00:27,744 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:29,530 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-11-13 13:00:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:00:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-13 13:00:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:29,538 INFO L225 Difference]: With dead ends: 137 [2024-11-13 13:00:29,538 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 13:00:29,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:00:29,539 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:29,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:00:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 13:00:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-11-13 13:00:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 13:00:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-13 13:00:29,591 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-13 13:00:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:29,591 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-13 13:00:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-13 13:00:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:00:29,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:29,598 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:00:29,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 184031335, now seen corresponding path program 1 times [2024-11-13 13:00:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630778459] [2024-11-13 13:00:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:00:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:00:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:00:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:00:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:00:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:00:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:00:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:00:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 13:00:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:00:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:00:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:00:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:00:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:00:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:00:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 13:00:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:00:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 13:00:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:31,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630778459] [2024-11-13 13:00:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630778459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:31,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:00:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991008918] [2024-11-13 13:00:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:31,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:00:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:00:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:00:31,412 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:32,289 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2024-11-13 13:00:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:00:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-13 13:00:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:32,292 INFO L225 Difference]: With dead ends: 133 [2024-11-13 13:00:32,293 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 13:00:32,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:00:32,297 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:32,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 352 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:00:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 13:00:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-11-13 13:00:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 13:00:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-13 13:00:32,336 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-13 13:00:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-13 13:00:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-13 13:00:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:00:32,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:32,343 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:32,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:00:32,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:32,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -910917657, now seen corresponding path program 1 times [2024-11-13 13:00:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:32,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612958696] [2024-11-13 13:00:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:00:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:00:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:00:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:00:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:00:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:00:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:00:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:00:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 13:00:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:00:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:00:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:00:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:00:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:00:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:00:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 13:00:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:00:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 13:00:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612958696] [2024-11-13 13:00:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612958696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:00:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567580460] [2024-11-13 13:00:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:00:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:32,575 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:32,766 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2024-11-13 13:00:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-13 13:00:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:32,769 INFO L225 Difference]: With dead ends: 193 [2024-11-13 13:00:32,769 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 13:00:32,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:32,771 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:32,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 245 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 13:00:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-13 13:00:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 13:00:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-13 13:00:32,790 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 107 [2024-11-13 13:00:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:32,790 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-13 13:00:32,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-13 13:00:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-13 13:00:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 13:00:32,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:32,796 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:00:32,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 706417966, now seen corresponding path program 1 times [2024-11-13 13:00:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192816263] [2024-11-13 13:00:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:00:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:00:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:00:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:00:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:00:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:00:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:00:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:00:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 13:00:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:00:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:00:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:00:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:00:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:00:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:00:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 13:00:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:00:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:00:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 13:00:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 13:00:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 13:00:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 13:00:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 13:00:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 13:00:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 13:00:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 13:00:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 13:00:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 13:00:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 13:00:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-13 13:00:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-13 13:00:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-13 13:00:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-13 13:00:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-13 13:00:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2279 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2024-11-13 13:00:33,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:33,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192816263] [2024-11-13 13:00:33,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192816263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:33,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:33,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:00:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694121762] [2024-11-13 13:00:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:00:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:33,198 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-13 13:00:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:33,388 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-11-13 13:00:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:00:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-11-13 13:00:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:33,392 INFO L225 Difference]: With dead ends: 133 [2024-11-13 13:00:33,392 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 13:00:33,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:33,394 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:33,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 13:00:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 13:00:33,402 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) [2024-11-13 13:00:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 13:00:33,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2024-11-13 13:00:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:33,403 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:00:33,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-13 13:00:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 13:00:33,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 13:00:33,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:00:33,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:00:33,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 13:00:33,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 13:00:33,588 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:00:33,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:00:33 BoogieIcfgContainer [2024-11-13 13:00:33,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:00:33,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:00:33,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:00:33,619 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:00:33,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:21" (3/4) ... [2024-11-13 13:00:33,623 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 13:00:33,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 13:00:33,638 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 13:00:33,638 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 13:00:33,638 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 13:00:33,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 13:00:33,766 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:00:33,767 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 13:00:33,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:00:33,770 INFO L158 Benchmark]: Toolchain (without parser) took 13744.25ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 118.7MB in the beginning and 212.7MB in the end (delta: -94.0MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,771 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 167.8MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:33,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.31ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 106.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.52ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 103.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,773 INFO L158 Benchmark]: Boogie Preprocessor took 100.10ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 101.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:33,774 INFO L158 Benchmark]: RCFGBuilder took 579.84ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 84.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,774 INFO L158 Benchmark]: TraceAbstraction took 12381.14ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.8MB in the beginning and 220.8MB in the end (delta: -137.1MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,775 INFO L158 Benchmark]: Witness Printer took 148.10ms. Allocated memory is still 427.8MB. Free memory was 220.8MB in the beginning and 212.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:33,778 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.53ms. Allocated memory is still 167.8MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.31ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 106.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.52ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 103.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.10ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 101.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 579.84ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 84.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12381.14ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.8MB in the beginning and 220.8MB in the end (delta: -137.1MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. * Witness Printer took 148.10ms. Allocated memory is still 427.8MB. Free memory was 220.8MB in the beginning and 212.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 5, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 300 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 78 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4455/4455 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: 98]: Loop Invariant Derived loop invariant: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) Ensures: (((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 13:00:33,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfa4a7dd-19f6-4151-a32e-9a86d692caa1/bin/uautomizer-verify-qhAvR1uOyd/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