./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:45:33,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:45:33,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:45:33,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:45:33,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:45:33,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:45:33,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:45:33,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:45:33,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:45:33,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:45:33,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:45:33,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:45:33,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:45:33,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:45:33,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:45:33,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:45:33,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:45:33,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:45:33,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:45:33,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:45:33,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:45:33,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:45:33,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:45:33,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:45:33,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:45:33,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:45:33,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:45:33,314 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-jdk21/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2025-02-06 08:45:33,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:45:33,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:45:33,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:45:33,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:45:33,542 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:45:33,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2025-02-06 08:45:34,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ea25ddd1/dad5e5c617e94a6dae9a5d1c30f51b97/FLAGd69838401 [2025-02-06 08:45:35,117 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:45:35,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2025-02-06 08:45:35,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ea25ddd1/dad5e5c617e94a6dae9a5d1c30f51b97/FLAGd69838401 [2025-02-06 08:45:35,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ea25ddd1/dad5e5c617e94a6dae9a5d1c30f51b97 [2025-02-06 08:45:35,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:45:35,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:45:35,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:45:35,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:45:35,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:45:35,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:45:35" (1/1) ... [2025-02-06 08:45:35,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f15f21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:35, skipping insertion in model container [2025-02-06 08:45:35,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:45:35" (1/1) ... [2025-02-06 08:45:35,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:45:35,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2025-02-06 08:45:35,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2025-02-06 08:45:35,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2025-02-06 08:45:35,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2025-02-06 08:45:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:45:35,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:45:36,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2025-02-06 08:45:36,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2025-02-06 08:45:36,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2025-02-06 08:45:36,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2025-02-06 08:45:36,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:45:36,126 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:45:36,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36 WrapperNode [2025-02-06 08:45:36,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:45:36,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:45:36,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:45:36,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:45:36,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,215 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-02-06 08:45:36,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:45:36,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:45:36,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:45:36,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:45:36,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,342 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2025-02-06 08:45:36,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:45:36,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:45:36,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:45:36,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:45:36,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (1/1) ... [2025-02-06 08:45:36,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:45:36,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:45:36,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:45:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:45:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-02-06 08:45:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:45:36,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-02-06 08:45:36,473 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:45:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-02-06 08:45:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:45:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:45:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:45:36,665 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:45:36,667 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:45:36,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-02-06 08:45:37,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-02-06 08:45:37,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-02-06 08:45:37,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:45:37,846 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-02-06 08:45:37,846 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:45:37,919 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:45:37,919 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:45:37,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:45:37 BoogieIcfgContainer [2025-02-06 08:45:37,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:45:37,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:45:37,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:45:37,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:45:37,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:45:35" (1/3) ... [2025-02-06 08:45:37,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a0e5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:45:37, skipping insertion in model container [2025-02-06 08:45:37,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:45:36" (2/3) ... [2025-02-06 08:45:37,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a0e5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:45:37, skipping insertion in model container [2025-02-06 08:45:37,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:45:37" (3/3) ... [2025-02-06 08:45:37,932 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2025-02-06 08:45:37,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:45:37,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-2.i that has 5 procedures, 469 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2025-02-06 08:45:38,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:45:38,023 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;@22e61747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:45:38,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 08:45:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 469 states, 444 states have (on average 1.5945945945945945) internal successors, (708), 449 states have internal predecessors, (708), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:45:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 08:45:38,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:38,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:38,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 629085497, now seen corresponding path program 1 times [2025-02-06 08:45:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:38,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550982400] [2025-02-06 08:45:38,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 08:45:38,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 08:45:38,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550982400] [2025-02-06 08:45:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550982400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:38,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:38,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:45:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094561229] [2025-02-06 08:45:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:45:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:38,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:45:38,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:45:38,172 INFO L87 Difference]: Start difference. First operand has 469 states, 444 states have (on average 1.5945945945945945) internal successors, (708), 449 states have internal predecessors, (708), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:38,305 INFO L93 Difference]: Finished difference Result 934 states and 1487 transitions. [2025-02-06 08:45:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:45:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 08:45:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:38,319 INFO L225 Difference]: With dead ends: 934 [2025-02-06 08:45:38,319 INFO L226 Difference]: Without dead ends: 464 [2025-02-06 08:45:38,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:45:38,328 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:38,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:45:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-02-06 08:45:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-02-06 08:45:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 441 states have (on average 1.4285714285714286) internal successors, (630), 445 states have internal predecessors, (630), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 660 transitions. [2025-02-06 08:45:38,380 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 660 transitions. Word has length 8 [2025-02-06 08:45:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:38,380 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 660 transitions. [2025-02-06 08:45:38,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 660 transitions. [2025-02-06 08:45:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 08:45:38,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:38,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:38,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:45:38,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -307089900, now seen corresponding path program 1 times [2025-02-06 08:45:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144509655] [2025-02-06 08:45:38,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:38,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 08:45:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 08:45:38,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:38,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144509655] [2025-02-06 08:45:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144509655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:38,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:45:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044414] [2025-02-06 08:45:38,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:38,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:45:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:38,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:45:38,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:45:38,577 INFO L87 Difference]: Start difference. First operand 464 states and 660 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:38,989 INFO L93 Difference]: Finished difference Result 1150 states and 1646 transitions. [2025-02-06 08:45:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:45:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 08:45:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:38,994 INFO L225 Difference]: With dead ends: 1150 [2025-02-06 08:45:38,994 INFO L226 Difference]: Without dead ends: 901 [2025-02-06 08:45:38,995 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-02-06 08:45:38,995 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 603 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:38,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1861 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:45:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-02-06 08:45:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 466. [2025-02-06 08:45:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4266365688487586) internal successors, (632), 447 states have internal predecessors, (632), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 662 transitions. [2025-02-06 08:45:39,037 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 662 transitions. Word has length 10 [2025-02-06 08:45:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 662 transitions. [2025-02-06 08:45:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 662 transitions. [2025-02-06 08:45:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:45:39,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:39,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:39,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:45:39,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:39,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 425259841, now seen corresponding path program 1 times [2025-02-06 08:45:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613074410] [2025-02-06 08:45:39,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:45:39,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:45:39,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:39,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613074410] [2025-02-06 08:45:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613074410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:45:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303351861] [2025-02-06 08:45:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:39,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:45:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:39,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:45:39,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:45:39,386 INFO L87 Difference]: Start difference. First operand 466 states and 662 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:39,532 INFO L93 Difference]: Finished difference Result 931 states and 1323 transitions. [2025-02-06 08:45:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:45:39,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:45:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:39,535 INFO L225 Difference]: With dead ends: 931 [2025-02-06 08:45:39,535 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 08:45:39,536 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-02-06 08:45:39,536 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 105 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:39,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1686 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:45:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 08:45:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2025-02-06 08:45:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4108352144469527) internal successors, (625), 447 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 655 transitions. [2025-02-06 08:45:39,559 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 655 transitions. Word has length 66 [2025-02-06 08:45:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:39,559 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 655 transitions. [2025-02-06 08:45:39,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 655 transitions. [2025-02-06 08:45:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:45:39,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:39,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:45:39,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -993137785, now seen corresponding path program 1 times [2025-02-06 08:45:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129539150] [2025-02-06 08:45:39,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:39,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:45:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:45:39,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:39,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129539150] [2025-02-06 08:45:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129539150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:45:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236337409] [2025-02-06 08:45:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:40,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:45:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:40,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:45:40,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:45:40,023 INFO L87 Difference]: Start difference. First operand 466 states and 655 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:40,572 INFO L93 Difference]: Finished difference Result 962 states and 1351 transitions. [2025-02-06 08:45:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:45:40,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:45:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:40,574 INFO L225 Difference]: With dead ends: 962 [2025-02-06 08:45:40,575 INFO L226 Difference]: Without dead ends: 500 [2025-02-06 08:45:40,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:40,576 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 14 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:40,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2505 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-06 08:45:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 493. [2025-02-06 08:45:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 470 states have (on average 1.4) internal successors, (658), 474 states have internal predecessors, (658), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 688 transitions. [2025-02-06 08:45:40,591 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 688 transitions. Word has length 66 [2025-02-06 08:45:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:40,591 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 688 transitions. [2025-02-06 08:45:40,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 688 transitions. [2025-02-06 08:45:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:45:40,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:40,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:40,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:45:40,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:40,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1787534617, now seen corresponding path program 1 times [2025-02-06 08:45:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053286890] [2025-02-06 08:45:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:40,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:45:40,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:45:40,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:40,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053286890] [2025-02-06 08:45:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053286890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:45:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985309076] [2025-02-06 08:45:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:45:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:40,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:45:40,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:45:40,919 INFO L87 Difference]: Start difference. First operand 493 states and 688 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:41,197 INFO L93 Difference]: Finished difference Result 991 states and 1386 transitions. [2025-02-06 08:45:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:45:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:45:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:41,202 INFO L225 Difference]: With dead ends: 991 [2025-02-06 08:45:41,202 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 08:45:41,203 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-02-06 08:45:41,204 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 17 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:41,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1639 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:45:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 08:45:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 494. [2025-02-06 08:45:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 471 states have (on average 1.3991507430997876) internal successors, (659), 475 states have internal predecessors, (659), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 689 transitions. [2025-02-06 08:45:41,218 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 689 transitions. Word has length 67 [2025-02-06 08:45:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:41,218 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 689 transitions. [2025-02-06 08:45:41,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 689 transitions. [2025-02-06 08:45:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:45:41,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:41,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:41,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:45:41,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -941440, now seen corresponding path program 1 times [2025-02-06 08:45:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179465086] [2025-02-06 08:45:41,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:41,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:45:41,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:45:41,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:41,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:41,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:41,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179465086] [2025-02-06 08:45:41,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179465086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:41,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:41,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:45:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195598877] [2025-02-06 08:45:41,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:41,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:45:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:41,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:45:41,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:41,450 INFO L87 Difference]: Start difference. First operand 494 states and 689 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:41,980 INFO L93 Difference]: Finished difference Result 996 states and 1393 transitions. [2025-02-06 08:45:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:45:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:45:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:41,984 INFO L225 Difference]: With dead ends: 996 [2025-02-06 08:45:41,984 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 08:45:41,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:41,985 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 14 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:41,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3010 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 08:45:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2025-02-06 08:45:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 480 states have (on average 1.4) internal successors, (672), 484 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 702 transitions. [2025-02-06 08:45:42,005 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 702 transitions. Word has length 67 [2025-02-06 08:45:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:42,006 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 702 transitions. [2025-02-06 08:45:42,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 702 transitions. [2025-02-06 08:45:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:45:42,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:42,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:42,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:45:42,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:42,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1713217380, now seen corresponding path program 1 times [2025-02-06 08:45:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:42,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554815337] [2025-02-06 08:45:42,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:42,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:45:42,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:45:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554815337] [2025-02-06 08:45:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554815337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:42,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:45:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100785241] [2025-02-06 08:45:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:42,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:45:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:42,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:45:42,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:45:42,209 INFO L87 Difference]: Start difference. First operand 503 states and 702 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:42,643 INFO L93 Difference]: Finished difference Result 1005 states and 1405 transitions. [2025-02-06 08:45:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:45:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:45:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:42,646 INFO L225 Difference]: With dead ends: 1005 [2025-02-06 08:45:42,646 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 08:45:42,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:45:42,649 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 8 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:42,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2534 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:45:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 08:45:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-02-06 08:45:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 483 states have (on average 1.3975155279503106) internal successors, (675), 487 states have internal predecessors, (675), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 705 transitions. [2025-02-06 08:45:42,662 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 705 transitions. Word has length 68 [2025-02-06 08:45:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:42,662 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 705 transitions. [2025-02-06 08:45:42,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 705 transitions. [2025-02-06 08:45:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:45:42,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:42,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:45:42,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1561271424, now seen corresponding path program 1 times [2025-02-06 08:45:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129300859] [2025-02-06 08:45:42,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:42,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:45:42,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:45:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:42,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129300859] [2025-02-06 08:45:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129300859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:45:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133158238] [2025-02-06 08:45:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:45:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:43,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:45:43,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:43,023 INFO L87 Difference]: Start difference. First operand 506 states and 705 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:43,761 INFO L93 Difference]: Finished difference Result 1024 states and 1431 transitions. [2025-02-06 08:45:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:45:43,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:45:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:43,764 INFO L225 Difference]: With dead ends: 1024 [2025-02-06 08:45:43,764 INFO L226 Difference]: Without dead ends: 522 [2025-02-06 08:45:43,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:45:43,769 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 33 mSDsluCounter, 3493 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:43,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4086 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:45:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-06 08:45:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 516. [2025-02-06 08:45:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-02-06 08:45:43,780 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 68 [2025-02-06 08:45:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:43,780 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-02-06 08:45:43,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-02-06 08:45:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:45:43,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:43,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:43,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:45:43,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:43,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2090436, now seen corresponding path program 1 times [2025-02-06 08:45:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:43,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463679532] [2025-02-06 08:45:43,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:43,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:45:43,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:45:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:43,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463679532] [2025-02-06 08:45:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463679532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:45:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125222027] [2025-02-06 08:45:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:45:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:44,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:45:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:45:44,144 INFO L87 Difference]: Start difference. First operand 516 states and 719 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:44,675 INFO L93 Difference]: Finished difference Result 1034 states and 1443 transitions. [2025-02-06 08:45:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:45:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:45:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:44,678 INFO L225 Difference]: With dead ends: 1034 [2025-02-06 08:45:44,679 INFO L226 Difference]: Without dead ends: 522 [2025-02-06 08:45:44,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:45:44,681 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 27 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:44,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3107 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-06 08:45:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-02-06 08:45:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3951612903225807) internal successors, (692), 500 states have internal predecessors, (692), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 722 transitions. [2025-02-06 08:45:44,696 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 722 transitions. Word has length 68 [2025-02-06 08:45:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:44,696 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 722 transitions. [2025-02-06 08:45:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 722 transitions. [2025-02-06 08:45:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:45:44,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:44,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:44,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:45:44,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:44,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1389420454, now seen corresponding path program 1 times [2025-02-06 08:45:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334996330] [2025-02-06 08:45:44,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:44,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:45:44,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:45:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:44,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334996330] [2025-02-06 08:45:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334996330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:44,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:44,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:45:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156188460] [2025-02-06 08:45:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:45:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:44,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:45:44,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:44,900 INFO L87 Difference]: Start difference. First operand 519 states and 722 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:45,426 INFO L93 Difference]: Finished difference Result 1041 states and 1451 transitions. [2025-02-06 08:45:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:45:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:45:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:45,428 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 08:45:45,428 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 08:45:45,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:45:45,431 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 12 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:45,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3013 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 08:45:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 519. [2025-02-06 08:45:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3951612903225807) internal successors, (692), 500 states have internal predecessors, (692), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 722 transitions. [2025-02-06 08:45:45,446 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 722 transitions. Word has length 69 [2025-02-06 08:45:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:45,447 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 722 transitions. [2025-02-06 08:45:45,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 722 transitions. [2025-02-06 08:45:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:45:45,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:45,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:45:45,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1770865388, now seen corresponding path program 1 times [2025-02-06 08:45:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:45,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394244496] [2025-02-06 08:45:45,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:45:45,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:45:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394244496] [2025-02-06 08:45:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394244496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:45,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:45:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846959564] [2025-02-06 08:45:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:45,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:45:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:45:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:45,890 INFO L87 Difference]: Start difference. First operand 519 states and 722 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:46,982 INFO L93 Difference]: Finished difference Result 1527 states and 2138 transitions. [2025-02-06 08:45:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:45:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:45:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:46,986 INFO L225 Difference]: With dead ends: 1527 [2025-02-06 08:45:46,986 INFO L226 Difference]: Without dead ends: 1012 [2025-02-06 08:45:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:45:46,987 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 905 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:46,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3745 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:45:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-02-06 08:45:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 550. [2025-02-06 08:45:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.381404174573055) internal successors, (728), 531 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 758 transitions. [2025-02-06 08:45:47,001 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 758 transitions. Word has length 69 [2025-02-06 08:45:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 758 transitions. [2025-02-06 08:45:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 758 transitions. [2025-02-06 08:45:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:45:47,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:47,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:47,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:45:47,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1468094950, now seen corresponding path program 1 times [2025-02-06 08:45:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529178645] [2025-02-06 08:45:47,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:47,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:45:47,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:45:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529178645] [2025-02-06 08:45:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529178645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:47,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:45:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780195632] [2025-02-06 08:45:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:47,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:45:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:47,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:45:47,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:47,181 INFO L87 Difference]: Start difference. First operand 550 states and 758 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:47,890 INFO L93 Difference]: Finished difference Result 1093 states and 1515 transitions. [2025-02-06 08:45:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:45:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:45:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:47,893 INFO L225 Difference]: With dead ends: 1093 [2025-02-06 08:45:47,893 INFO L226 Difference]: Without dead ends: 578 [2025-02-06 08:45:47,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:45:47,895 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 37 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:47,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3999 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:45:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-06 08:45:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 553. [2025-02-06 08:45:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 530 states have (on average 1.381132075471698) internal successors, (732), 534 states have internal predecessors, (732), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2025-02-06 08:45:47,907 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 70 [2025-02-06 08:45:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:47,907 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2025-02-06 08:45:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2025-02-06 08:45:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:45:47,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:47,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:47,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:45:47,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:47,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -381596387, now seen corresponding path program 1 times [2025-02-06 08:45:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710146690] [2025-02-06 08:45:47,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:47,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:45:47,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:45:47,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:47,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710146690] [2025-02-06 08:45:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710146690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:48,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:48,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:45:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964040335] [2025-02-06 08:45:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:48,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:45:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:48,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:45:48,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:48,167 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:48,677 INFO L93 Difference]: Finished difference Result 1084 states and 1502 transitions. [2025-02-06 08:45:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:45:48,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:45:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:48,680 INFO L225 Difference]: With dead ends: 1084 [2025-02-06 08:45:48,680 INFO L226 Difference]: Without dead ends: 566 [2025-02-06 08:45:48,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:48,681 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 20 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:48,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3169 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-06 08:45:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 553. [2025-02-06 08:45:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 530 states have (on average 1.381132075471698) internal successors, (732), 534 states have internal predecessors, (732), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2025-02-06 08:45:48,698 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 70 [2025-02-06 08:45:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2025-02-06 08:45:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2025-02-06 08:45:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:45:48,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:48,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:45:48,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:48,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1121106445, now seen corresponding path program 1 times [2025-02-06 08:45:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481018139] [2025-02-06 08:45:48,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:48,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:45:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:45:48,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:48,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481018139] [2025-02-06 08:45:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481018139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:45:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122505520] [2025-02-06 08:45:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:45:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:48,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:45:48,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:45:48,937 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:49,664 INFO L93 Difference]: Finished difference Result 1092 states and 1514 transitions. [2025-02-06 08:45:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:45:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:45:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:49,667 INFO L225 Difference]: With dead ends: 1092 [2025-02-06 08:45:49,667 INFO L226 Difference]: Without dead ends: 574 [2025-02-06 08:45:49,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:45:49,668 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 17 mSDsluCounter, 3911 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4494 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:49,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4494 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:45:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-06 08:45:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 566. [2025-02-06 08:45:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 543 states have (on average 1.3793738489871086) internal successors, (749), 547 states have internal predecessors, (749), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 779 transitions. [2025-02-06 08:45:49,681 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 779 transitions. Word has length 71 [2025-02-06 08:45:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:49,681 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 779 transitions. [2025-02-06 08:45:49,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 779 transitions. [2025-02-06 08:45:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:45:49,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:49,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:49,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:45:49,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:49,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1309251437, now seen corresponding path program 1 times [2025-02-06 08:45:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591420701] [2025-02-06 08:45:49,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:49,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:45:49,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:45:49,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:49,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591420701] [2025-02-06 08:45:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591420701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:45:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411337475] [2025-02-06 08:45:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:45:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:49,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:45:49,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:49,895 INFO L87 Difference]: Start difference. First operand 566 states and 779 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:50,375 INFO L93 Difference]: Finished difference Result 1101 states and 1523 transitions. [2025-02-06 08:45:50,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:45:50,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:45:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:50,377 INFO L225 Difference]: With dead ends: 1101 [2025-02-06 08:45:50,377 INFO L226 Difference]: Without dead ends: 570 [2025-02-06 08:45:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:50,379 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 11 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:50,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3055 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-06 08:45:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2025-02-06 08:45:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 540 states have (on average 1.3777777777777778) internal successors, (744), 544 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 774 transitions. [2025-02-06 08:45:50,391 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 774 transitions. Word has length 71 [2025-02-06 08:45:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:50,391 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 774 transitions. [2025-02-06 08:45:50,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 774 transitions. [2025-02-06 08:45:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:45:50,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:50,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:45:50,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1426534871, now seen corresponding path program 1 times [2025-02-06 08:45:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541010670] [2025-02-06 08:45:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:50,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:45:50,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:45:50,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:50,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541010670] [2025-02-06 08:45:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541010670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:45:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355079275] [2025-02-06 08:45:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:45:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:50,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:45:50,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:50,573 INFO L87 Difference]: Start difference. First operand 563 states and 774 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:51,083 INFO L93 Difference]: Finished difference Result 1096 states and 1516 transitions. [2025-02-06 08:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:45:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:45:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:51,086 INFO L225 Difference]: With dead ends: 1096 [2025-02-06 08:45:51,086 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 08:45:51,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:45:51,087 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 8 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:51,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2983 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:45:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 08:45:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2025-02-06 08:45:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 544 states have (on average 1.3768382352941178) internal successors, (749), 548 states have internal predecessors, (749), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 779 transitions. [2025-02-06 08:45:51,104 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 779 transitions. Word has length 71 [2025-02-06 08:45:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 779 transitions. [2025-02-06 08:45:51,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2025-02-06 08:45:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:45:51,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:51,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:51,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:45:51,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:51,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash -354968949, now seen corresponding path program 1 times [2025-02-06 08:45:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:51,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264639342] [2025-02-06 08:45:51,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:51,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:45:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:45:51,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:51,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264639342] [2025-02-06 08:45:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264639342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:51,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:45:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688079030] [2025-02-06 08:45:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:45:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:51,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:45:51,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:45:51,525 INFO L87 Difference]: Start difference. First operand 567 states and 779 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:54,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:45:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:55,429 INFO L93 Difference]: Finished difference Result 1121 states and 1547 transitions. [2025-02-06 08:45:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:45:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:45:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:55,432 INFO L225 Difference]: With dead ends: 1121 [2025-02-06 08:45:55,432 INFO L226 Difference]: Without dead ends: 589 [2025-02-06 08:45:55,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:45:55,434 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 44 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:55,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4441 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-06 08:45:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-06 08:45:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 564. [2025-02-06 08:45:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 541 states have (on average 1.3752310536044363) internal successors, (744), 545 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 774 transitions. [2025-02-06 08:45:55,449 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 774 transitions. Word has length 72 [2025-02-06 08:45:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 774 transitions. [2025-02-06 08:45:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 774 transitions. [2025-02-06 08:45:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:45:55,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:55,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:45:55,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -270138913, now seen corresponding path program 1 times [2025-02-06 08:45:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306359231] [2025-02-06 08:45:55,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:45:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:45:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306359231] [2025-02-06 08:45:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306359231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 08:45:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282056049] [2025-02-06 08:45:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:45:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:55,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:45:55,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:45:55,677 INFO L87 Difference]: Start difference. First operand 564 states and 774 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:56,845 INFO L93 Difference]: Finished difference Result 1110 states and 1531 transitions. [2025-02-06 08:45:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:45:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:45:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:56,849 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 08:45:56,850 INFO L226 Difference]: Without dead ends: 581 [2025-02-06 08:45:56,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:45:56,851 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 40 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:56,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4547 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 08:45:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-06 08:45:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 570. [2025-02-06 08:45:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 547 states have (on average 1.3729433272394882) internal successors, (751), 551 states have internal predecessors, (751), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 781 transitions. [2025-02-06 08:45:56,863 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 781 transitions. Word has length 72 [2025-02-06 08:45:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:56,863 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 781 transitions. [2025-02-06 08:45:56,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 781 transitions. [2025-02-06 08:45:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:45:56,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:56,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:45:56,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1431603191, now seen corresponding path program 1 times [2025-02-06 08:45:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043684912] [2025-02-06 08:45:56,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:45:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:45:56,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:56,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:45:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:45:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:45:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043684912] [2025-02-06 08:45:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043684912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:45:57,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:45:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:45:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467796802] [2025-02-06 08:45:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:45:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:45:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:45:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:45:57,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:45:57,035 INFO L87 Difference]: Start difference. First operand 570 states and 781 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:45:57,995 INFO L93 Difference]: Finished difference Result 1131 states and 1558 transitions. [2025-02-06 08:45:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:45:57,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:45:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:45:57,998 INFO L225 Difference]: With dead ends: 1131 [2025-02-06 08:45:57,999 INFO L226 Difference]: Without dead ends: 596 [2025-02-06 08:45:58,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:45:58,000 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 33 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:45:58,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4018 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:45:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-06 08:45:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 567. [2025-02-06 08:45:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 544 states have (on average 1.375) internal successors, (748), 548 states have internal predecessors, (748), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:45:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 778 transitions. [2025-02-06 08:45:58,020 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 778 transitions. Word has length 72 [2025-02-06 08:45:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:45:58,020 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 778 transitions. [2025-02-06 08:45:58,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:45:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 778 transitions. [2025-02-06 08:45:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:45:58,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:45:58,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:45:58,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:45:58,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:45:58,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:45:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1315997383, now seen corresponding path program 1 times [2025-02-06 08:45:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:45:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078682078] [2025-02-06 08:45:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:45:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:45:58,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:45:58,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:45:58,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:45:58,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:46:10,000 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 08:46:22,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-02-06 08:46:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:46:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:46:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078682078] [2025-02-06 08:46:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078682078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:46:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:46:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 08:46:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336228720] [2025-02-06 08:46:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:46:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:46:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:46:22,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:46:22,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-06 08:46:22,081 INFO L87 Difference]: Start difference. First operand 567 states and 778 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:46:26,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:27,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:31,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:33,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:37,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:41,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:45,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-02-06 08:46:47,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:51,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:55,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:46:59,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:47:02,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:47:06,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []