./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:22:15,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:22:15,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:22:15,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:22:15,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:22:15,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:22:15,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:22:15,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:22:15,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:22:15,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:22:15,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:22:15,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:22:15,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:22:15,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:22:15,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:22:15,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:22:15,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:22:15,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:22:15,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:22:15,412 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2025-03-08 18:22:15,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:22:15,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:22:15,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:22:15,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:22:15,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:22:15,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-08 18:22:16,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56bde52c/90631930f637401895b543c2d366d30a/FLAGe3f995e42 [2025-03-08 18:22:16,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:22:16,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-08 18:22:17,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56bde52c/90631930f637401895b543c2d366d30a/FLAGe3f995e42 [2025-03-08 18:22:17,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56bde52c/90631930f637401895b543c2d366d30a [2025-03-08 18:22:17,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:22:17,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:22:17,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:22:17,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:22:17,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:22:17,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:17" (1/1) ... [2025-03-08 18:22:17,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f959b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:17, skipping insertion in model container [2025-03-08 18:22:17,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:17" (1/1) ... [2025-03-08 18:22:17,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:22:17,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-08 18:22:17,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:22:17,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:22:17,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-08 18:22:17,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:22:18,018 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:22:18,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18 WrapperNode [2025-03-08 18:22:18,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:22:18,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:22:18,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:22:18,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:22:18,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,091 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1011 [2025-03-08 18:22:18,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:22:18,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:22:18,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:22:18,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:22:18,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,175 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 6, 42, 82, 8, 20]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 0, 6, 8, 1]. The 103 writes are split as follows [0, 0, 42, 42, 0, 19]. [2025-03-08 18:22:18,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:22:18,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:22:18,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:22:18,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:22:18,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (1/1) ... [2025-03-08 18:22:18,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:22:18,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:18,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:22:18,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:22:18,271 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2025-03-08 18:22:18,271 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-08 18:22:18,272 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-08 18:22:18,272 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2025-03-08 18:22:18,272 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-08 18:22:18,272 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-08 18:22:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 18:22:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 18:22:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 18:22:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-08 18:22:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-08 18:22:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-08 18:22:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:22:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:22:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:22:18,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:22:18,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:22:18,535 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc usb_register_driver_#t~nondet120#1; [2025-03-08 18:22:18,542 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc #t~ret114.base, #t~ret114.offset; [2025-03-08 18:22:18,613 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4204: havoc #t~malloc112.base, #t~malloc112.offset; [2025-03-08 18:22:18,620 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc #t~nondet115; [2025-03-08 18:22:18,626 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc #t~nondet118; [2025-03-08 18:22:18,645 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4207: havoc __kmalloc_#t~ret113#1.base, __kmalloc_#t~ret113#1.offset; [2025-03-08 18:22:18,646 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-08 18:22:18,651 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4239: havoc #t~ret117.base, #t~ret117.offset; [2025-03-08 18:22:23,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc strlcat_#t~nondet119#1; [2025-03-08 18:22:23,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3513: havoc input_allocate_device_#t~ret28#1.base, input_allocate_device_#t~ret28#1.offset; [2025-03-08 18:22:23,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume false; [2025-03-08 18:22:23,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume !false; [2025-03-08 18:22:23,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4224: havoc input_register_device_#t~nondet116#1; [2025-03-08 18:22:23,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc __create_pipe_#t~mem26#1;havoc __create_pipe_#t~bitwise27#1; [2025-03-08 18:22:23,388 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-03-08 18:22:23,388 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:22:23,409 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:22:23,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:22:23,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:23 BoogieIcfgContainer [2025-03-08 18:22:23,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:22:23,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:22:23,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:22:23,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:22:23,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:22:17" (1/3) ... [2025-03-08 18:22:23,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689b6831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:23, skipping insertion in model container [2025-03-08 18:22:23,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:18" (2/3) ... [2025-03-08 18:22:23,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689b6831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:23, skipping insertion in model container [2025-03-08 18:22:23,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:23" (3/3) ... [2025-03-08 18:22:23,421 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-08 18:22:23,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:22:23,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i that has 16 procedures, 202 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 18:22:23,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:22:23,493 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;@669caa57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:22:23,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:22:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 163 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 18:22:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 18:22:23,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:23,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:23,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1559058473, now seen corresponding path program 1 times [2025-03-08 18:22:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906519794] [2025-03-08 18:22:23,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:24,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 18:22:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 18:22:24,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:22:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906519794] [2025-03-08 18:22:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906519794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600416539] [2025-03-08 18:22:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:25,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:25,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:25,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:25,018 INFO L87 Difference]: Start difference. First operand has 201 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 163 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 18:22:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:25,223 INFO L93 Difference]: Finished difference Result 551 states and 754 transitions. [2025-03-08 18:22:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 18:22:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:25,232 INFO L225 Difference]: With dead ends: 551 [2025-03-08 18:22:25,232 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 18:22:25,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:25,239 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 235 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:25,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 505 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 18:22:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2025-03-08 18:22:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 279 states have (on average 1.2580645161290323) internal successors, (351), 283 states have internal predecessors, (351), 50 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 18:22:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 447 transitions. [2025-03-08 18:22:25,304 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 447 transitions. Word has length 17 [2025-03-08 18:22:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:25,304 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 447 transitions. [2025-03-08 18:22:25,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 18:22:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 447 transitions. [2025-03-08 18:22:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 18:22:25,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:25,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:25,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 18:22:25,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1086430579, now seen corresponding path program 1 times [2025-03-08 18:22:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267814311] [2025-03-08 18:22:25,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:26,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 18:22:26,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 18:22:26,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:26,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:22:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267814311] [2025-03-08 18:22:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267814311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723558200] [2025-03-08 18:22:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:26,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:26,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:26,437 INFO L87 Difference]: Start difference. First operand 354 states and 447 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 18:22:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:26,590 INFO L93 Difference]: Finished difference Result 1023 states and 1302 transitions. [2025-03-08 18:22:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:26,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 18:22:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:26,598 INFO L225 Difference]: With dead ends: 1023 [2025-03-08 18:22:26,599 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 18:22:26,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:26,603 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 225 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 517 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 18:22:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 672. [2025-03-08 18:22:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 533 states have (on average 1.2551594746716699) internal successors, (669), 536 states have internal predecessors, (669), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 18:22:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 851 transitions. [2025-03-08 18:22:26,657 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 851 transitions. Word has length 18 [2025-03-08 18:22:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:26,657 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 851 transitions. [2025-03-08 18:22:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 18:22:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 851 transitions. [2025-03-08 18:22:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 18:22:26,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:26,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:26,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:22:26,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:26,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash -423599947, now seen corresponding path program 1 times [2025-03-08 18:22:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090858880] [2025-03-08 18:22:26,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:27,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 18:22:27,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 18:22:27,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:22:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090858880] [2025-03-08 18:22:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090858880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546990386] [2025-03-08 18:22:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:27,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:27,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:27,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:27,799 INFO L87 Difference]: Start difference. First operand 672 states and 851 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 18:22:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:27,934 INFO L93 Difference]: Finished difference Result 1370 states and 1754 transitions. [2025-03-08 18:22:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 18:22:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:27,938 INFO L225 Difference]: With dead ends: 1370 [2025-03-08 18:22:27,939 INFO L226 Difference]: Without dead ends: 715 [2025-03-08 18:22:27,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:27,941 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 105 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:27,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 342 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-08 18:22:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 703. [2025-03-08 18:22:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 564 states have (on average 1.2606382978723405) internal successors, (711), 567 states have internal predecessors, (711), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 18:22:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 893 transitions. [2025-03-08 18:22:27,979 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 893 transitions. Word has length 49 [2025-03-08 18:22:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:27,980 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 893 transitions. [2025-03-08 18:22:27,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 18:22:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 893 transitions. [2025-03-08 18:22:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 18:22:27,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:27,984 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:22:27,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -933518385, now seen corresponding path program 1 times [2025-03-08 18:22:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116343681] [2025-03-08 18:22:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:28,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:22:28,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:22:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:22:29,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116343681] [2025-03-08 18:22:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116343681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:22:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907115031] [2025-03-08 18:22:29,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:29,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:22:29,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:22:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:22:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:22:31,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:31,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:31,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 18:22:31,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:22:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 18:22:31,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:22:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907115031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:22:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 18:22:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109704311] [2025-03-08 18:22:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:31,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:22:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:31,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:22:31,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:22:31,230 INFO L87 Difference]: Start difference. First operand 703 states and 893 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:22:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:31,370 INFO L93 Difference]: Finished difference Result 1152 states and 1460 transitions. [2025-03-08 18:22:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:22:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 18:22:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:31,375 INFO L225 Difference]: With dead ends: 1152 [2025-03-08 18:22:31,376 INFO L226 Difference]: Without dead ends: 467 [2025-03-08 18:22:31,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:22:31,378 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:31,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 669 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-08 18:22:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-08 18:22:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 370 states have (on average 1.2459459459459459) internal successors, (461), 373 states have internal predecessors, (461), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 18:22:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 583 transitions. [2025-03-08 18:22:31,400 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 583 transitions. Word has length 86 [2025-03-08 18:22:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 583 transitions. [2025-03-08 18:22:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:22:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 583 transitions. [2025-03-08 18:22:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:22:31,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:31,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:31,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 18:22:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:31,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 31772938, now seen corresponding path program 1 times [2025-03-08 18:22:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432628071] [2025-03-08 18:22:31,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:22:32,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:22:32,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:32,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 18:22:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432628071] [2025-03-08 18:22:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432628071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:22:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991947035] [2025-03-08 18:22:33,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:33,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:22:33,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:22:34,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:22:34,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:22:34,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:34,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:34,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 18:22:34,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:22:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 18:22:34,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:22:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991947035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:34,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:22:34,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 18:22:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146370447] [2025-03-08 18:22:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:22:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:34,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:22:34,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:22:34,380 INFO L87 Difference]: Start difference. First operand 467 states and 583 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:22:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:34,490 INFO L93 Difference]: Finished difference Result 921 states and 1152 transitions. [2025-03-08 18:22:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:22:34,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-08 18:22:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:34,493 INFO L225 Difference]: With dead ends: 921 [2025-03-08 18:22:34,493 INFO L226 Difference]: Without dead ends: 467 [2025-03-08 18:22:34,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:22:34,495 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:34,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1118 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-08 18:22:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-08 18:22:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 370 states have (on average 1.2432432432432432) internal successors, (460), 373 states have internal predecessors, (460), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 18:22:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 582 transitions. [2025-03-08 18:22:34,509 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 582 transitions. Word has length 85 [2025-03-08 18:22:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:34,510 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 582 transitions. [2025-03-08 18:22:34,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:22:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 582 transitions. [2025-03-08 18:22:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:22:34,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:34,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:34,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 18:22:34,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:34,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:34,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1538242690, now seen corresponding path program 1 times [2025-03-08 18:22:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892294235] [2025-03-08 18:22:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:35,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:22:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:22:35,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 18:22:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892294235] [2025-03-08 18:22:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892294235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:22:36,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997641998] [2025-03-08 18:22:36,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:36,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:36,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:36,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:22:36,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 18:22:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:22:37,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:22:37,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:37,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:37,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 18:22:37,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:22:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:22:37,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:22:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997641998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:22:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2025-03-08 18:22:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813626145] [2025-03-08 18:22:37,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:22:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:37,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:22:37,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:22:37,617 INFO L87 Difference]: Start difference. First operand 467 states and 582 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:22:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:37,877 INFO L93 Difference]: Finished difference Result 952 states and 1197 transitions. [2025-03-08 18:22:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:22:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-08 18:22:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:37,883 INFO L225 Difference]: With dead ends: 952 [2025-03-08 18:22:37,883 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 18:22:37,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:22:37,885 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:37,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2007 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 18:22:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 500. [2025-03-08 18:22:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 397 states have (on average 1.234256926952141) internal successors, (490), 400 states have internal predecessors, (490), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2025-03-08 18:22:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 627 transitions. [2025-03-08 18:22:37,899 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 627 transitions. Word has length 90 [2025-03-08 18:22:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:37,899 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 627 transitions. [2025-03-08 18:22:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:22:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 627 transitions. [2025-03-08 18:22:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:22:37,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:37,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:37,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 18:22:38,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:38,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:38,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -644756352, now seen corresponding path program 1 times [2025-03-08 18:22:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59728648] [2025-03-08 18:22:38,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:38,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:22:38,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:22:38,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:38,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 18:22:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59728648] [2025-03-08 18:22:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59728648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:22:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731732386] [2025-03-08 18:22:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:39,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:22:39,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:22:39,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:22:40,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:22:40,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:22:40,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:40,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:40,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 18:22:40,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:22:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:22:40,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:22:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 18:22:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731732386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:22:41,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:22:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-03-08 18:22:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289617540] [2025-03-08 18:22:41,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:22:41,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:22:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:41,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:22:41,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:41,003 INFO L87 Difference]: Start difference. First operand 500 states and 627 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:22:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:41,254 INFO L93 Difference]: Finished difference Result 1021 states and 1290 transitions. [2025-03-08 18:22:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:22:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 90 [2025-03-08 18:22:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:41,257 INFO L225 Difference]: With dead ends: 1021 [2025-03-08 18:22:41,257 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 18:22:41,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:41,258 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 4 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:41,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1753 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 18:22:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 515. [2025-03-08 18:22:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 409 states have (on average 1.2273838630806846) internal successors, (502), 409 states have internal predecessors, (502), 66 states have call successors, (66), 34 states have call predecessors, (66), 39 states have return successors, (80), 71 states have call predecessors, (80), 62 states have call successors, (80) [2025-03-08 18:22:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 648 transitions. [2025-03-08 18:22:41,272 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 648 transitions. Word has length 90 [2025-03-08 18:22:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:41,273 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 648 transitions. [2025-03-08 18:22:41,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:22:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 648 transitions. [2025-03-08 18:22:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:22:41,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:41,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:41,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 18:22:41,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:22:41,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:41,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash -442932418, now seen corresponding path program 2 times [2025-03-08 18:22:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:41,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771919961] [2025-03-08 18:22:41,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:22:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:42,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-08 18:22:42,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 90 statements. [2025-03-08 18:22:42,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 18:22:42,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 18:22:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771919961] [2025-03-08 18:22:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771919961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:22:42,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770219740] [2025-03-08 18:22:42,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:42,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:22:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:42,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:22:42,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:22:42,582 INFO L87 Difference]: Start difference. First operand 515 states and 648 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:42,732 INFO L93 Difference]: Finished difference Result 918 states and 1165 transitions. [2025-03-08 18:22:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:22:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-08 18:22:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:42,736 INFO L225 Difference]: With dead ends: 918 [2025-03-08 18:22:42,736 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 18:22:42,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:22:42,740 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:42,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1331 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:22:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 18:22:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 18:22:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.2209026128266034) internal successors, (514), 418 states have internal predecessors, (514), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-03-08 18:22:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 665 transitions. [2025-03-08 18:22:42,756 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 665 transitions. Word has length 90 [2025-03-08 18:22:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:42,757 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 665 transitions. [2025-03-08 18:22:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 665 transitions. [2025-03-08 18:22:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:22:42,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:42,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:42,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:22:42,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:42,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -420300164, now seen corresponding path program 1 times [2025-03-08 18:22:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525308446] [2025-03-08 18:22:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:43,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:22:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:22:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 18:22:44,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525308446] [2025-03-08 18:22:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525308446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:22:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575890272] [2025-03-08 18:22:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:22:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:22:44,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:44,128 INFO L87 Difference]: Start difference. First operand 530 states and 665 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:44,314 INFO L93 Difference]: Finished difference Result 928 states and 1174 transitions. [2025-03-08 18:22:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:22:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-08 18:22:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:44,317 INFO L225 Difference]: With dead ends: 928 [2025-03-08 18:22:44,317 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 18:22:44,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:44,318 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:44,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1752 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 18:22:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 18:22:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.2161520190023754) internal successors, (512), 418 states have internal predecessors, (512), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-03-08 18:22:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 663 transitions. [2025-03-08 18:22:44,331 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 663 transitions. Word has length 90 [2025-03-08 18:22:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:44,331 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 663 transitions. [2025-03-08 18:22:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:22:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 663 transitions. [2025-03-08 18:22:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 18:22:44,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:44,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:44,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 18:22:44,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2098071131, now seen corresponding path program 1 times [2025-03-08 18:22:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817007201] [2025-03-08 18:22:44,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:45,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:22:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:22:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:22:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:45,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817007201] [2025-03-08 18:22:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817007201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:45,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:45,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:22:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086700080] [2025-03-08 18:22:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:45,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:22:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:45,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:22:45,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:22:45,415 INFO L87 Difference]: Start difference. First operand 530 states and 663 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:22:49,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:22:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:49,792 INFO L93 Difference]: Finished difference Result 933 states and 1177 transitions. [2025-03-08 18:22:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:22:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2025-03-08 18:22:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:49,797 INFO L225 Difference]: With dead ends: 933 [2025-03-08 18:22:49,797 INFO L226 Difference]: Without dead ends: 930 [2025-03-08 18:22:49,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:22:49,798 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 304 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:49,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 694 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 18:22:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-08 18:22:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 902. [2025-03-08 18:22:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 723 states have (on average 1.2268326417704012) internal successors, (887), 716 states have internal predecessors, (887), 110 states have call successors, (110), 54 states have call predecessors, (110), 68 states have return successors, (149), 131 states have call predecessors, (149), 106 states have call successors, (149) [2025-03-08 18:22:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1146 transitions. [2025-03-08 18:22:49,833 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1146 transitions. Word has length 91 [2025-03-08 18:22:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:49,834 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1146 transitions. [2025-03-08 18:22:49,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:22:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1146 transitions. [2025-03-08 18:22:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 18:22:49,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:49,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:49,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:22:49,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:49,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1240900645, now seen corresponding path program 1 times [2025-03-08 18:22:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278805821] [2025-03-08 18:22:49,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:50,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 18:22:50,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 18:22:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 18:22:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278805821] [2025-03-08 18:22:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278805821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:22:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889712615] [2025-03-08 18:22:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:22:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:50,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:22:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:22:50,841 INFO L87 Difference]: Start difference. First operand 902 states and 1146 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:22:54,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:22:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:54,978 INFO L93 Difference]: Finished difference Result 1801 states and 2293 transitions. [2025-03-08 18:22:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:22:54,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2025-03-08 18:22:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:54,984 INFO L225 Difference]: With dead ends: 1801 [2025-03-08 18:22:54,984 INFO L226 Difference]: Without dead ends: 884 [2025-03-08 18:22:54,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:22:54,986 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 92 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:54,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 803 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 18:22:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-08 18:22:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 857. [2025-03-08 18:22:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 688 states have (on average 1.2209302325581395) internal successors, (840), 685 states have internal predecessors, (840), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 123 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-08 18:22:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1092 transitions. [2025-03-08 18:22:55,013 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1092 transitions. Word has length 102 [2025-03-08 18:22:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:55,013 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1092 transitions. [2025-03-08 18:22:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:22:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1092 transitions. [2025-03-08 18:22:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 18:22:55,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:55,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:55,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 18:22:55,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1013182512, now seen corresponding path program 1 times [2025-03-08 18:22:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771415208] [2025-03-08 18:22:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 18:22:55,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 18:22:55,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:55,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 18:22:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771415208] [2025-03-08 18:22:56,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771415208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:56,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:56,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:22:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828531060] [2025-03-08 18:22:56,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:22:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:56,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:22:56,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:22:56,219 INFO L87 Difference]: Start difference. First operand 857 states and 1092 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:22:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:56,417 INFO L93 Difference]: Finished difference Result 1271 states and 1626 transitions. [2025-03-08 18:22:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:22:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-08 18:22:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:56,421 INFO L225 Difference]: With dead ends: 1271 [2025-03-08 18:22:56,422 INFO L226 Difference]: Without dead ends: 865 [2025-03-08 18:22:56,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:22:56,423 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:56,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1362 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-08 18:22:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2025-03-08 18:22:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 696 states have (on average 1.2183908045977012) internal successors, (848), 689 states have internal predecessors, (848), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-08 18:22:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1100 transitions. [2025-03-08 18:22:56,448 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1100 transitions. Word has length 110 [2025-03-08 18:22:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:56,449 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1100 transitions. [2025-03-08 18:22:56,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:22:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1100 transitions. [2025-03-08 18:22:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 18:22:56,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:56,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:56,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 18:22:56,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:56,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash -353650990, now seen corresponding path program 1 times [2025-03-08 18:22:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101293720] [2025-03-08 18:22:56,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:57,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 18:22:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 18:22:57,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:57,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 18:22:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101293720] [2025-03-08 18:22:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101293720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:22:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969830761] [2025-03-08 18:22:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:22:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:57,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:22:57,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:57,781 INFO L87 Difference]: Start difference. First operand 865 states and 1100 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:22:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:58,037 INFO L93 Difference]: Finished difference Result 917 states and 1158 transitions. [2025-03-08 18:22:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:22:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-08 18:22:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:58,042 INFO L225 Difference]: With dead ends: 917 [2025-03-08 18:22:58,042 INFO L226 Difference]: Without dead ends: 869 [2025-03-08 18:22:58,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:22:58,043 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:58,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1759 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:22:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-08 18:22:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-03-08 18:22:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 700 states have (on average 1.217142857142857) internal successors, (852), 693 states have internal predecessors, (852), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-08 18:22:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1104 transitions. [2025-03-08 18:22:58,068 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1104 transitions. Word has length 110 [2025-03-08 18:22:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:58,068 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1104 transitions. [2025-03-08 18:22:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:22:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1104 transitions. [2025-03-08 18:22:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 18:22:58,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:58,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 18:22:58,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2045744846, now seen corresponding path program 1 times [2025-03-08 18:22:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878682230] [2025-03-08 18:22:58,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:22:58,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 18:22:59,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 18:22:59,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:22:59,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:22:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:22:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:22:59,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878682230] [2025-03-08 18:22:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878682230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:22:59,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:22:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:22:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364529947] [2025-03-08 18:22:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:22:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:22:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:22:59,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:22:59,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:59,207 INFO L87 Difference]: Start difference. First operand 869 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:22:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:22:59,269 INFO L93 Difference]: Finished difference Result 1647 states and 2110 transitions. [2025-03-08 18:22:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:22:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-08 18:22:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:22:59,274 INFO L225 Difference]: With dead ends: 1647 [2025-03-08 18:22:59,274 INFO L226 Difference]: Without dead ends: 833 [2025-03-08 18:22:59,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:22:59,277 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:22:59,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:22:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-08 18:22:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-08 18:22:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 670 states have (on average 1.2119402985074628) internal successors, (812), 667 states have internal predecessors, (812), 105 states have call successors, (105), 48 states have call predecessors, (105), 57 states have return successors, (133), 117 states have call predecessors, (133), 101 states have call successors, (133) [2025-03-08 18:22:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1050 transitions. [2025-03-08 18:22:59,305 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1050 transitions. Word has length 111 [2025-03-08 18:22:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:22:59,305 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1050 transitions. [2025-03-08 18:22:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:22:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1050 transitions. [2025-03-08 18:22:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 18:22:59,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:22:59,307 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:22:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 18:22:59,307 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:22:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:22:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1679909643, now seen corresponding path program 1 times [2025-03-08 18:22:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:22:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184206278] [2025-03-08 18:22:59,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:22:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:00,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 18:23:00,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 18:23:00,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:00,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 18:23:00,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184206278] [2025-03-08 18:23:00,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184206278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:23:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995759732] [2025-03-08 18:23:00,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:00,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:23:00,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:23:00,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:23:00,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:23:01,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 18:23:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 18:23:01,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:01,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:01,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1760 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:23:01,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:23:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 18:23:02,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:23:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:23:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995759732] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:23:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:23:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 7] total 13 [2025-03-08 18:23:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828291715] [2025-03-08 18:23:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:02,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:23:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:02,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:23:02,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:23:02,521 INFO L87 Difference]: Start difference. First operand 833 states and 1050 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:23:06,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:07,459 INFO L93 Difference]: Finished difference Result 2258 states and 2841 transitions. [2025-03-08 18:23:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:23:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2025-03-08 18:23:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:07,467 INFO L225 Difference]: With dead ends: 2258 [2025-03-08 18:23:07,467 INFO L226 Difference]: Without dead ends: 1794 [2025-03-08 18:23:07,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:23:07,470 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 466 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:07,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1070 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 18:23:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-03-08 18:23:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1679. [2025-03-08 18:23:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1340 states have (on average 1.2186567164179105) internal successors, (1633), 1343 states have internal predecessors, (1633), 214 states have call successors, (214), 102 states have call predecessors, (214), 124 states have return successors, (279), 233 states have call predecessors, (279), 208 states have call successors, (279) [2025-03-08 18:23:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2126 transitions. [2025-03-08 18:23:07,514 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2126 transitions. Word has length 113 [2025-03-08 18:23:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:07,514 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2126 transitions. [2025-03-08 18:23:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:23:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2126 transitions. [2025-03-08 18:23:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 18:23:07,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:07,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:07,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 18:23:07,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 18:23:07,718 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:07,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1423049108, now seen corresponding path program 1 times [2025-03-08 18:23:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049152318] [2025-03-08 18:23:07,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 18:23:08,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 18:23:08,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 18:23:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049152318] [2025-03-08 18:23:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049152318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:09,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:23:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963475332] [2025-03-08 18:23:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:09,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:09,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:09,316 INFO L87 Difference]: Start difference. First operand 1679 states and 2126 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:23:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:09,408 INFO L93 Difference]: Finished difference Result 2384 states and 3015 transitions. [2025-03-08 18:23:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:23:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2025-03-08 18:23:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:09,413 INFO L225 Difference]: With dead ends: 2384 [2025-03-08 18:23:09,413 INFO L226 Difference]: Without dead ends: 909 [2025-03-08 18:23:09,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:09,416 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:09,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 663 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:23:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-08 18:23:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2025-03-08 18:23:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 724 states have (on average 1.2085635359116023) internal successors, (875), 725 states have internal predecessors, (875), 116 states have call successors, (116), 57 states have call predecessors, (116), 68 states have return successors, (149), 126 states have call predecessors, (149), 111 states have call successors, (149) [2025-03-08 18:23:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1140 transitions. [2025-03-08 18:23:09,437 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1140 transitions. Word has length 136 [2025-03-08 18:23:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:09,438 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1140 transitions. [2025-03-08 18:23:09,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:23:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1140 transitions. [2025-03-08 18:23:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 18:23:09,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:09,439 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 18:23:09,439 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1046327252, now seen corresponding path program 1 times [2025-03-08 18:23:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567207007] [2025-03-08 18:23:09,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:10,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 18:23:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 18:23:10,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:10,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 18:23:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567207007] [2025-03-08 18:23:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567207007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:23:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160692741] [2025-03-08 18:23:10,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:10,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:10,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:10,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:10,680 INFO L87 Difference]: Start difference. First operand 909 states and 1140 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 18:23:14,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:14,983 INFO L93 Difference]: Finished difference Result 1462 states and 1835 transitions. [2025-03-08 18:23:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:23:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 136 [2025-03-08 18:23:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:14,989 INFO L225 Difference]: With dead ends: 1462 [2025-03-08 18:23:14,989 INFO L226 Difference]: Without dead ends: 1457 [2025-03-08 18:23:14,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:14,990 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 212 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:14,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 623 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 18:23:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-08 18:23:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1421. [2025-03-08 18:23:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1133 states have (on average 1.2056487202118271) internal successors, (1366), 1130 states have internal predecessors, (1366), 180 states have call successors, (180), 87 states have call predecessors, (180), 107 states have return successors, (245), 203 states have call predecessors, (245), 175 states have call successors, (245) [2025-03-08 18:23:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1791 transitions. [2025-03-08 18:23:15,023 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1791 transitions. Word has length 136 [2025-03-08 18:23:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:15,024 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1791 transitions. [2025-03-08 18:23:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 18:23:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1791 transitions. [2025-03-08 18:23:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 18:23:15,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:15,025 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 18:23:15,025 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -997798143, now seen corresponding path program 1 times [2025-03-08 18:23:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303919721] [2025-03-08 18:23:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:16,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 18:23:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 18:23:16,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 18:23:16,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303919721] [2025-03-08 18:23:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303919721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:16,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:23:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468085616] [2025-03-08 18:23:16,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:16,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:16,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:16,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:16,231 INFO L87 Difference]: Start difference. First operand 1421 states and 1791 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:23:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:16,309 INFO L93 Difference]: Finished difference Result 1465 states and 1837 transitions. [2025-03-08 18:23:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:23:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 150 [2025-03-08 18:23:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:16,317 INFO L225 Difference]: With dead ends: 1465 [2025-03-08 18:23:16,317 INFO L226 Difference]: Without dead ends: 1446 [2025-03-08 18:23:16,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:16,318 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 230 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:16,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 485 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:23:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2025-03-08 18:23:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1427. [2025-03-08 18:23:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1139 states have (on average 1.2010535557506585) internal successors, (1368), 1136 states have internal predecessors, (1368), 180 states have call successors, (180), 87 states have call predecessors, (180), 107 states have return successors, (245), 203 states have call predecessors, (245), 175 states have call successors, (245) [2025-03-08 18:23:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1793 transitions. [2025-03-08 18:23:16,360 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1793 transitions. Word has length 150 [2025-03-08 18:23:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:16,360 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1793 transitions. [2025-03-08 18:23:16,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:23:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1793 transitions. [2025-03-08 18:23:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 18:23:16,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:16,361 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 18:23:16,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2081483221, now seen corresponding path program 1 times [2025-03-08 18:23:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716073682] [2025-03-08 18:23:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:17,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 18:23:17,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 18:23:17,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:17,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 18:23:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716073682] [2025-03-08 18:23:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716073682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:23:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838170816] [2025-03-08 18:23:17,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:23:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:23:17,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:23:17,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:23:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 18:23:19,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 18:23:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:19,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 2370 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:23:19,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:23:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 18:23:19,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:23:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838170816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:19,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:23:19,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 18:23:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064158404] [2025-03-08 18:23:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:19,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:19,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:19,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:19,303 INFO L87 Difference]: Start difference. First operand 1427 states and 1793 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 18:23:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:19,408 INFO L93 Difference]: Finished difference Result 1956 states and 2450 transitions. [2025-03-08 18:23:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:23:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 153 [2025-03-08 18:23:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:19,411 INFO L225 Difference]: With dead ends: 1956 [2025-03-08 18:23:19,411 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 18:23:19,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:19,413 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 66 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:19,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 526 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:23:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 18:23:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2025-03-08 18:23:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 564 states have (on average 1.1861702127659575) internal successors, (669), 565 states have internal predecessors, (669), 89 states have call successors, (89), 50 states have call predecessors, (89), 57 states have return successors, (110), 95 states have call predecessors, (110), 85 states have call successors, (110) [2025-03-08 18:23:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 868 transitions. [2025-03-08 18:23:19,430 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 868 transitions. Word has length 153 [2025-03-08 18:23:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:19,431 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 868 transitions. [2025-03-08 18:23:19,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 18:23:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 868 transitions. [2025-03-08 18:23:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 18:23:19,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:19,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:19,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 18:23:19,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:23:19,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1727890800, now seen corresponding path program 1 times [2025-03-08 18:23:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461027070] [2025-03-08 18:23:19,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:20,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 18:23:20,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 18:23:20,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:20,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 18:23:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461027070] [2025-03-08 18:23:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461027070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:23:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11219225] [2025-03-08 18:23:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:23:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:20,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:23:20,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:23:20,682 INFO L87 Difference]: Start difference. First operand 711 states and 868 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:23:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:20,730 INFO L93 Difference]: Finished difference Result 983 states and 1202 transitions. [2025-03-08 18:23:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:23:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-08 18:23:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:20,733 INFO L225 Difference]: With dead ends: 983 [2025-03-08 18:23:20,734 INFO L226 Difference]: Without dead ends: 453 [2025-03-08 18:23:20,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:23:20,735 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:20,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:23:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-08 18:23:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-03-08 18:23:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 360 states have (on average 1.175) internal successors, (423), 361 states have internal predecessors, (423), 57 states have call successors, (57), 33 states have call predecessors, (57), 35 states have return successors, (63), 58 states have call predecessors, (63), 53 states have call successors, (63) [2025-03-08 18:23:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 543 transitions. [2025-03-08 18:23:20,748 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 543 transitions. Word has length 165 [2025-03-08 18:23:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:20,748 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 543 transitions. [2025-03-08 18:23:20,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:23:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 543 transitions. [2025-03-08 18:23:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 18:23:20,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:20,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:20,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 18:23:20,750 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1122314925, now seen corresponding path program 1 times [2025-03-08 18:23:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080183570] [2025-03-08 18:23:20,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 18:23:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 18:23:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:23:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080183570] [2025-03-08 18:23:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080183570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:23:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875009173] [2025-03-08 18:23:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:21,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:23:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:23:21,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:23:21,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:23:23,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 18:23:23,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 18:23:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:23,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 2405 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:23:23,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:23:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 18:23:24,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:23:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875009173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:23:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 10 [2025-03-08 18:23:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027619838] [2025-03-08 18:23:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:23:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:24,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:23:24,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:23:24,018 INFO L87 Difference]: Start difference. First operand 453 states and 543 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 18:23:28,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:32,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:36,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:36,595 INFO L93 Difference]: Finished difference Result 465 states and 552 transitions. [2025-03-08 18:23:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:23:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 167 [2025-03-08 18:23:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:36,598 INFO L225 Difference]: With dead ends: 465 [2025-03-08 18:23:36,598 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 18:23:36,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:23:36,599 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 268 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:36,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 433 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 387 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-03-08 18:23:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 18:23:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 410. [2025-03-08 18:23:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 325 states have (on average 1.1753846153846155) internal successors, (382), 329 states have internal predecessors, (382), 52 states have call successors, (52), 32 states have call predecessors, (52), 32 states have return successors, (51), 48 states have call predecessors, (51), 48 states have call successors, (51) [2025-03-08 18:23:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 485 transitions. [2025-03-08 18:23:36,611 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 485 transitions. Word has length 167 [2025-03-08 18:23:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:36,611 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 485 transitions. [2025-03-08 18:23:36,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 18:23:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 485 transitions. [2025-03-08 18:23:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 18:23:36,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:36,613 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:36,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:23:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:23:36,815 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:36,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1464983057, now seen corresponding path program 1 times [2025-03-08 18:23:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:36,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912795476] [2025-03-08 18:23:36,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:37,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 18:23:37,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 18:23:37,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:37,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 18:23:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912795476] [2025-03-08 18:23:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912795476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:23:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896210438] [2025-03-08 18:23:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:23:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:37,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:23:37,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:37,812 INFO L87 Difference]: Start difference. First operand 410 states and 485 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 18:23:41,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:23:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:23:41,913 INFO L93 Difference]: Finished difference Result 419 states and 492 transitions. [2025-03-08 18:23:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:23:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 194 [2025-03-08 18:23:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:23:41,918 INFO L225 Difference]: With dead ends: 419 [2025-03-08 18:23:41,918 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 18:23:41,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:23:41,920 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 77 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:23:41,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 726 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 18:23:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 18:23:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-03-08 18:23:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 289 states have (on average 1.1764705882352942) internal successors, (340), 291 states have internal predecessors, (340), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (42), 41 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-08 18:23:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 425 transitions. [2025-03-08 18:23:41,932 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 425 transitions. Word has length 194 [2025-03-08 18:23:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:23:41,932 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 425 transitions. [2025-03-08 18:23:41,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 18:23:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 425 transitions. [2025-03-08 18:23:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 18:23:41,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:23:41,934 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:23:41,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 18:23:41,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:23:41,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:23:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -805698838, now seen corresponding path program 1 times [2025-03-08 18:23:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:23:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121403428] [2025-03-08 18:23:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:23:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:23:42,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 18:23:42,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 18:23:42,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:23:42,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:23:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-08 18:23:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:23:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121403428] [2025-03-08 18:23:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121403428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:23:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:23:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:23:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418334495] [2025-03-08 18:23:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:23:43,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:23:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:23:43,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:23:43,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:23:43,056 INFO L87 Difference]: Start difference. First operand 361 states and 425 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 4 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)