./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_SFH_test6-1.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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:59:18,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:59:18,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:59:18,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:59:18,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:59:18,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:59:18,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:59:18,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:59:18,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:59:18,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:59:18,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:59:18,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:59:18,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:59:18,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:59:18,380 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:59:18,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:59:18,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:59:18,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:18,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:59:18,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:18,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:59:18,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:59:18,383 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2025-01-09 20:59:18,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:59:18,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:59:18,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:59:18,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:59:18,677 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:59:18,678 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_SFH_test6-1.i [2025-01-09 20:59:20,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9bbf8ce/d46ff7847a964841b9748a662a64d654/FLAG4d8a98d46 [2025-01-09 20:59:20,394 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:59:20,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2025-01-09 20:59:20,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9bbf8ce/d46ff7847a964841b9748a662a64d654/FLAG4d8a98d46 [2025-01-09 20:59:20,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9bbf8ce/d46ff7847a964841b9748a662a64d654 [2025-01-09 20:59:20,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:59:20,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:59:20,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:20,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:59:20,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:59:20,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:20" (1/1) ... [2025-01-09 20:59:20,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:20, skipping insertion in model container [2025-01-09 20:59:20,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:20" (1/1) ... [2025-01-09 20:59:20,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:59:20,832 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_SFH_test6-1.i[44118,44131] [2025-01-09 20:59:20,848 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_SFH_test6-1.i[44660,44673] [2025-01-09 20:59:20,945 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_SFH_test6-1.i[56247,56260] [2025-01-09 20:59:20,946 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_SFH_test6-1.i[56368,56381] [2025-01-09 20:59:20,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:20,963 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:59:21,014 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_SFH_test6-1.i[44118,44131] [2025-01-09 20:59:21,016 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_SFH_test6-1.i[44660,44673] [2025-01-09 20:59:21,093 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_SFH_test6-1.i[56247,56260] [2025-01-09 20:59:21,094 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_SFH_test6-1.i[56368,56381] [2025-01-09 20:59:21,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:21,157 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:59:21,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21 WrapperNode [2025-01-09 20:59:21,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:21,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:21,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:59:21,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:59:21,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,241 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-01-09 20:59:21,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:21,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:59:21,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:59:21,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:59:21,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,339 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-01-09 20:59:21,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:59:21,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:59:21,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:59:21,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:59:21,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:21,490 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-01-09 20:59:21,501 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-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:59:21,521 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-01-09 20:59:21,521 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:59:21,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-01-09 20:59:21,522 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-01-09 20:59:21,522 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-01-09 20:59:21,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:59:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:59:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:59:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:59:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:59:21,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:59:21,756 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:59:21,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:59:23,241 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-01-09 20:59:23,242 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:59:23,284 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:59:23,289 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:59:23,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:23 BoogieIcfgContainer [2025-01-09 20:59:23,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:59:23,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:59:23,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:59:23,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:59:23,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:59:20" (1/3) ... [2025-01-09 20:59:23,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:23, skipping insertion in model container [2025-01-09 20:59:23,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (2/3) ... [2025-01-09 20:59:23,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:23, skipping insertion in model container [2025-01-09 20:59:23,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:23" (3/3) ... [2025-01-09 20:59:23,301 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2025-01-09 20:59:23,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:59:23,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test6-1.i that has 5 procedures, 433 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2025-01-09 20:59:23,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:59:23,408 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;@5704e446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:59:23,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 20:59:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 411 states have (on average 1.5888077858880778) internal successors, (653), 415 states have internal predecessors, (653), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 20:59:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 20:59:23,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:23,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:23,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1883014248, now seen corresponding path program 1 times [2025-01-09 20:59:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674542952] [2025-01-09 20:59:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:23,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 20:59:23,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 20:59:23,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:23,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674542952] [2025-01-09 20:59:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674542952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:23,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:23,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:59:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076854639] [2025-01-09 20:59:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:23,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:59:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:23,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:59:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:59:23,633 INFO L87 Difference]: Start difference. First operand has 433 states, 411 states have (on average 1.5888077858880778) internal successors, (653), 415 states have internal predecessors, (653), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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-01-09 20:59:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:23,698 INFO L93 Difference]: Finished difference Result 862 states and 1367 transitions. [2025-01-09 20:59:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:59:23,700 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-01-09 20:59:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:23,709 INFO L225 Difference]: With dead ends: 862 [2025-01-09 20:59:23,709 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 20:59:23,714 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-01-09 20:59:23,716 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:23,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 20:59:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-01-09 20:59:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.435960591133005) internal successors, (583), 411 states have internal predecessors, (583), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 608 transitions. [2025-01-09 20:59:23,788 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 608 transitions. Word has length 8 [2025-01-09 20:59:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 608 transitions. [2025-01-09 20:59:23,789 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-01-09 20:59:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 608 transitions. [2025-01-09 20:59:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 20:59:23,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:23,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:23,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:59:23,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1883663023, now seen corresponding path program 1 times [2025-01-09 20:59:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62584033] [2025-01-09 20:59:23,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 20:59:23,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 20:59:23,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:23,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62584033] [2025-01-09 20:59:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62584033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:23,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446789778] [2025-01-09 20:59:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:23,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:23,980 INFO L87 Difference]: Start difference. First operand 427 states and 608 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-01-09 20:59:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:24,205 INFO L93 Difference]: Finished difference Result 1038 states and 1489 transitions. [2025-01-09 20:59:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:24,206 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-01-09 20:59:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:24,213 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 20:59:24,214 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 20:59:24,215 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-01-09 20:59:24,217 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 556 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:24,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1768 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 20:59:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 429. [2025-01-09 20:59:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 408 states have (on average 1.4338235294117647) internal successors, (585), 413 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 610 transitions. [2025-01-09 20:59:24,266 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 610 transitions. Word has length 10 [2025-01-09 20:59:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 610 transitions. [2025-01-09 20:59:24,267 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-01-09 20:59:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 610 transitions. [2025-01-09 20:59:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:24,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:24,269 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-01-09 20:59:24,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:59:24,269 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-01-09 20:59:24,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2022370072, now seen corresponding path program 1 times [2025-01-09 20:59:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047272489] [2025-01-09 20:59:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:24,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:24,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:24,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:24,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047272489] [2025-01-09 20:59:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047272489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396266226] [2025-01-09 20:59:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:24,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:24,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:24,609 INFO L87 Difference]: Start difference. First operand 429 states and 610 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-01-09 20:59:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:24,717 INFO L93 Difference]: Finished difference Result 812 states and 1150 transitions. [2025-01-09 20:59:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:24,718 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-01-09 20:59:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:24,722 INFO L225 Difference]: With dead ends: 812 [2025-01-09 20:59:24,722 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 20:59:24,723 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-01-09 20:59:24,725 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 30 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:24,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1502 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 20:59:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 20:59:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.3879781420765027) internal successors, (508), 371 states have internal predecessors, (508), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 533 transitions. [2025-01-09 20:59:24,753 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 533 transitions. Word has length 66 [2025-01-09 20:59:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:24,754 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 533 transitions. [2025-01-09 20:59:24,754 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-01-09 20:59:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 533 transitions. [2025-01-09 20:59:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:24,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:24,756 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-01-09 20:59:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:59:24,757 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-01-09 20:59:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash 37940060, now seen corresponding path program 1 times [2025-01-09 20:59:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465934770] [2025-01-09 20:59:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:24,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:24,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:24,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:24,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465934770] [2025-01-09 20:59:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465934770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:25,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:25,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:59:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435391198] [2025-01-09 20:59:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:25,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:25,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:25,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:25,033 INFO L87 Difference]: Start difference. First operand 387 states and 533 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-01-09 20:59:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:25,092 INFO L93 Difference]: Finished difference Result 770 states and 1062 transitions. [2025-01-09 20:59:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:25,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-01-09 20:59:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:25,097 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:59:25,097 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 20:59:25,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:25,099 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:25,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 20:59:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-01-09 20:59:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.3797814207650274) internal successors, (505), 371 states have internal predecessors, (505), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 530 transitions. [2025-01-09 20:59:25,117 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 530 transitions. Word has length 66 [2025-01-09 20:59:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 530 transitions. [2025-01-09 20:59:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-01-09 20:59:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 530 transitions. [2025-01-09 20:59:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:25,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:25,122 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-01-09 20:59:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:59:25,122 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-01-09 20:59:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2013043938, now seen corresponding path program 1 times [2025-01-09 20:59:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201392454] [2025-01-09 20:59:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:25,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:25,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201392454] [2025-01-09 20:59:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201392454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:25,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:25,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:59:25,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14111471] [2025-01-09 20:59:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:25,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:59:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:25,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:59:25,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:25,606 INFO L87 Difference]: Start difference. First operand 387 states and 530 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-01-09 20:59:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:25,962 INFO L93 Difference]: Finished difference Result 775 states and 1064 transitions. [2025-01-09 20:59:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:25,963 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-01-09 20:59:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:25,965 INFO L225 Difference]: With dead ends: 775 [2025-01-09 20:59:25,965 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 20:59:25,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:25,967 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 14 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:25,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2254 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 20:59:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2025-01-09 20:59:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 368 states have (on average 1.377717391304348) internal successors, (507), 373 states have internal predecessors, (507), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 532 transitions. [2025-01-09 20:59:25,978 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 532 transitions. Word has length 66 [2025-01-09 20:59:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:25,978 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 532 transitions. [2025-01-09 20:59:25,979 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-01-09 20:59:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2025-01-09 20:59:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:59:25,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:25,980 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-01-09 20:59:25,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:59:25,980 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-01-09 20:59:25,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 589047661, now seen corresponding path program 1 times [2025-01-09 20:59:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140524893] [2025-01-09 20:59:25,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:26,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:59:26,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:59:26,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:26,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140524893] [2025-01-09 20:59:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140524893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305217393] [2025-01-09 20:59:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:26,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:26,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:26,290 INFO L87 Difference]: Start difference. First operand 389 states and 532 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-01-09 20:59:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:26,634 INFO L93 Difference]: Finished difference Result 779 states and 1068 transitions. [2025-01-09 20:59:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:26,635 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-01-09 20:59:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:26,638 INFO L225 Difference]: With dead ends: 779 [2025-01-09 20:59:26,638 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 20:59:26,640 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-01-09 20:59:26,641 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 15 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:26,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2705 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 20:59:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2025-01-09 20:59:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.3763440860215055) internal successors, (512), 377 states have internal predecessors, (512), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 537 transitions. [2025-01-09 20:59:26,660 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 537 transitions. Word has length 67 [2025-01-09 20:59:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 537 transitions. [2025-01-09 20:59:26,663 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-01-09 20:59:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 537 transitions. [2025-01-09 20:59:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:59:26,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:26,665 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-01-09 20:59:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:59:26,665 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-01-09 20:59:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1871313919, now seen corresponding path program 1 times [2025-01-09 20:59:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787436311] [2025-01-09 20:59:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:26,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:59:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:59:26,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:26,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787436311] [2025-01-09 20:59:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787436311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764897441] [2025-01-09 20:59:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:26,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:26,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:26,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:26,998 INFO L87 Difference]: Start difference. First operand 393 states and 537 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-01-09 20:59:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:27,119 INFO L93 Difference]: Finished difference Result 782 states and 1070 transitions. [2025-01-09 20:59:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:27,121 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-01-09 20:59:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:27,123 INFO L225 Difference]: With dead ends: 782 [2025-01-09 20:59:27,124 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 20:59:27,125 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-01-09 20:59:27,125 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 17 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:27,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1417 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 20:59:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-01-09 20:59:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 377 states have internal predecessors, (511), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 536 transitions. [2025-01-09 20:59:27,139 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 536 transitions. Word has length 67 [2025-01-09 20:59:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:27,140 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 536 transitions. [2025-01-09 20:59:27,140 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-01-09 20:59:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 536 transitions. [2025-01-09 20:59:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:27,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:27,141 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-01-09 20:59:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:59:27,141 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-01-09 20:59:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1502346090, now seen corresponding path program 1 times [2025-01-09 20:59:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432529802] [2025-01-09 20:59:27,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:27,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:27,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:27,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432529802] [2025-01-09 20:59:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432529802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060284587] [2025-01-09 20:59:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:27,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:27,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:27,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:27,593 INFO L87 Difference]: Start difference. First operand 393 states and 536 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-01-09 20:59:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:28,086 INFO L93 Difference]: Finished difference Result 795 states and 1089 transitions. [2025-01-09 20:59:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:59:28,090 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-01-09 20:59:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:28,092 INFO L225 Difference]: With dead ends: 795 [2025-01-09 20:59:28,092 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:59:28,094 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-01-09 20:59:28,094 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 33 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:28,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3655 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:59:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:59:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2025-01-09 20:59:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 382 states have (on average 1.37434554973822) internal successors, (525), 387 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 550 transitions. [2025-01-09 20:59:28,111 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 550 transitions. Word has length 68 [2025-01-09 20:59:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 550 transitions. [2025-01-09 20:59:28,112 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-01-09 20:59:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 550 transitions. [2025-01-09 20:59:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:28,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:28,113 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-01-09 20:59:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:59:28,113 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-01-09 20:59:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1179950205, now seen corresponding path program 1 times [2025-01-09 20:59:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471138888] [2025-01-09 20:59:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:28,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:28,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:28,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:28,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471138888] [2025-01-09 20:59:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471138888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:28,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:59:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745591248] [2025-01-09 20:59:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:28,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:59:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:28,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:59:28,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:59:28,550 INFO L87 Difference]: Start difference. First operand 403 states and 550 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-01-09 20:59:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:28,916 INFO L93 Difference]: Finished difference Result 805 states and 1101 transitions. [2025-01-09 20:59:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:59:28,917 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-01-09 20:59:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:28,919 INFO L225 Difference]: With dead ends: 805 [2025-01-09 20:59:28,920 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:59:28,921 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-01-09 20:59:28,925 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 27 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:28,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2759 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:59:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-09 20:59:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 385 states have (on average 1.3714285714285714) internal successors, (528), 390 states have internal predecessors, (528), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 553 transitions. [2025-01-09 20:59:28,938 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 553 transitions. Word has length 68 [2025-01-09 20:59:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:28,939 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 553 transitions. [2025-01-09 20:59:28,939 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-01-09 20:59:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 553 transitions. [2025-01-09 20:59:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:28,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:28,940 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-01-09 20:59:28,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:59:28,942 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-01-09 20:59:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -18650941, now seen corresponding path program 1 times [2025-01-09 20:59:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684131486] [2025-01-09 20:59:28,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:28,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:28,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:28,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:29,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684131486] [2025-01-09 20:59:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684131486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:59:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82363144] [2025-01-09 20:59:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:29,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:59:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:29,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:59:29,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:29,175 INFO L87 Difference]: Start difference. First operand 406 states and 553 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-01-09 20:59:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:29,427 INFO L93 Difference]: Finished difference Result 811 states and 1107 transitions. [2025-01-09 20:59:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:29,427 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-01-09 20:59:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:29,430 INFO L225 Difference]: With dead ends: 811 [2025-01-09 20:59:29,430 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 20:59:29,431 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-01-09 20:59:29,431 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 8 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:29,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2276 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 20:59:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-01-09 20:59:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 388 states have (on average 1.3685567010309279) internal successors, (531), 393 states have internal predecessors, (531), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 556 transitions. [2025-01-09 20:59:29,445 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 556 transitions. Word has length 68 [2025-01-09 20:59:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:29,445 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 556 transitions. [2025-01-09 20:59:29,445 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-01-09 20:59:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 556 transitions. [2025-01-09 20:59:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:59:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:29,449 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-01-09 20:59:29,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:59:29,450 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-01-09 20:59:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1894995888, now seen corresponding path program 1 times [2025-01-09 20:59:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549359554] [2025-01-09 20:59:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:29,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:59:29,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:59:29,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:29,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549359554] [2025-01-09 20:59:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549359554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92689581] [2025-01-09 20:59:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:29,988 INFO L87 Difference]: Start difference. First operand 409 states and 556 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-01-09 20:59:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:30,893 INFO L93 Difference]: Finished difference Result 1181 states and 1618 transitions. [2025-01-09 20:59:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:30,894 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-01-09 20:59:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:30,899 INFO L225 Difference]: With dead ends: 1181 [2025-01-09 20:59:30,900 INFO L226 Difference]: Without dead ends: 776 [2025-01-09 20:59:30,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:59:30,903 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 627 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:30,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3066 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 20:59:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-01-09 20:59:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 447. [2025-01-09 20:59:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 426 states have (on average 1.3380281690140845) internal successors, (570), 431 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 595 transitions. [2025-01-09 20:59:30,923 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 595 transitions. Word has length 69 [2025-01-09 20:59:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:30,924 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 595 transitions. [2025-01-09 20:59:30,924 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-01-09 20:59:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 595 transitions. [2025-01-09 20:59:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:59:30,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:30,925 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-01-09 20:59:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:59:30,925 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-01-09 20:59:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1663240956, now seen corresponding path program 1 times [2025-01-09 20:59:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637133773] [2025-01-09 20:59:30,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:30,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:59:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:59:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:31,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:31,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637133773] [2025-01-09 20:59:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637133773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:31,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310561094] [2025-01-09 20:59:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:31,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:31,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:31,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:31,195 INFO L87 Difference]: Start difference. First operand 447 states and 595 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-01-09 20:59:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:31,546 INFO L93 Difference]: Finished difference Result 857 states and 1155 transitions. [2025-01-09 20:59:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:31,547 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-01-09 20:59:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:31,549 INFO L225 Difference]: With dead ends: 857 [2025-01-09 20:59:31,549 INFO L226 Difference]: Without dead ends: 452 [2025-01-09 20:59:31,551 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-01-09 20:59:31,551 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:31,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2712 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-09 20:59:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 447. [2025-01-09 20:59:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 426 states have (on average 1.3380281690140845) internal successors, (570), 431 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 595 transitions. [2025-01-09 20:59:31,569 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 595 transitions. Word has length 69 [2025-01-09 20:59:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:31,569 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 595 transitions. [2025-01-09 20:59:31,569 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-01-09 20:59:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 595 transitions. [2025-01-09 20:59:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:59:31,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:31,570 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-01-09 20:59:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:59:31,571 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-01-09 20:59:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1736365105, now seen corresponding path program 1 times [2025-01-09 20:59:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:31,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763527303] [2025-01-09 20:59:31,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:59:31,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:59:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763527303] [2025-01-09 20:59:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763527303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065154512] [2025-01-09 20:59:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:31,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:31,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:31,846 INFO L87 Difference]: Start difference. First operand 447 states and 595 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-01-09 20:59:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:32,204 INFO L93 Difference]: Finished difference Result 862 states and 1161 transitions. [2025-01-09 20:59:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:59:32,205 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-01-09 20:59:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:32,207 INFO L225 Difference]: With dead ends: 862 [2025-01-09 20:59:32,207 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 20:59:32,208 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-01-09 20:59:32,209 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 20 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:32,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3658 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 20:59:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 450. [2025-01-09 20:59:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.337995337995338) internal successors, (574), 434 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 599 transitions. [2025-01-09 20:59:32,227 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 599 transitions. Word has length 70 [2025-01-09 20:59:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:32,228 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 599 transitions. [2025-01-09 20:59:32,228 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-01-09 20:59:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 599 transitions. [2025-01-09 20:59:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:59:32,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:32,229 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-01-09 20:59:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:59:32,230 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-01-09 20:59:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash 400875699, now seen corresponding path program 1 times [2025-01-09 20:59:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33341969] [2025-01-09 20:59:32,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:32,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:59:32,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:59:32,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:32,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:32,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33341969] [2025-01-09 20:59:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33341969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35878841] [2025-01-09 20:59:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:32,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:32,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:32,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:32,495 INFO L87 Difference]: Start difference. First operand 450 states and 599 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-01-09 20:59:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:32,961 INFO L93 Difference]: Finished difference Result 872 states and 1173 transitions. [2025-01-09 20:59:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:32,962 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-01-09 20:59:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:32,964 INFO L225 Difference]: With dead ends: 872 [2025-01-09 20:59:32,964 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 20:59:32,965 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-01-09 20:59:32,966 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 37 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:32,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3611 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:59:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 20:59:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 450. [2025-01-09 20:59:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.337995337995338) internal successors, (574), 434 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 599 transitions. [2025-01-09 20:59:32,985 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 599 transitions. Word has length 70 [2025-01-09 20:59:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 599 transitions. [2025-01-09 20:59:32,986 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-01-09 20:59:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 599 transitions. [2025-01-09 20:59:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:32,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:32,986 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-01-09 20:59:32,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:59:32,987 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-01-09 20:59:32,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1971307340, now seen corresponding path program 1 times [2025-01-09 20:59:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089756306] [2025-01-09 20:59:32,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:33,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089756306] [2025-01-09 20:59:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089756306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629236700] [2025-01-09 20:59:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:33,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:33,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:33,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:33,305 INFO L87 Difference]: Start difference. First operand 450 states and 599 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-01-09 20:59:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:33,755 INFO L93 Difference]: Finished difference Result 874 states and 1178 transitions. [2025-01-09 20:59:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:33,755 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-01-09 20:59:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:33,758 INFO L225 Difference]: With dead ends: 874 [2025-01-09 20:59:33,758 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 20:59:33,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:59:33,760 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 23 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:33,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3675 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:59:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 20:59:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 460. [2025-01-09 20:59:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 439 states have (on average 1.3348519362186788) internal successors, (586), 444 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 611 transitions. [2025-01-09 20:59:33,776 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 611 transitions. Word has length 71 [2025-01-09 20:59:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:33,777 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 611 transitions. [2025-01-09 20:59:33,777 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-01-09 20:59:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 611 transitions. [2025-01-09 20:59:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:33,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:33,778 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-01-09 20:59:33,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:59:33,778 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-01-09 20:59:33,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -141351856, now seen corresponding path program 1 times [2025-01-09 20:59:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427739186] [2025-01-09 20:59:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:33,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:33,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:33,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427739186] [2025-01-09 20:59:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427739186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:34,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698525042] [2025-01-09 20:59:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:34,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:34,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:34,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:34,081 INFO L87 Difference]: Start difference. First operand 460 states and 611 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-01-09 20:59:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:34,557 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2025-01-09 20:59:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:34,558 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-01-09 20:59:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:34,561 INFO L225 Difference]: With dead ends: 894 [2025-01-09 20:59:34,561 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 20:59:34,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:34,562 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 17 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:34,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4070 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:59:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 20:59:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 463. [2025-01-09 20:59:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.334841628959276) internal successors, (590), 447 states have internal predecessors, (590), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 615 transitions. [2025-01-09 20:59:34,578 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 615 transitions. Word has length 71 [2025-01-09 20:59:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 615 transitions. [2025-01-09 20:59:34,579 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-01-09 20:59:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 615 transitions. [2025-01-09 20:59:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:34,579 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-01-09 20:59:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:59:34,579 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-01-09 20:59:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1639404592, now seen corresponding path program 1 times [2025-01-09 20:59:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721440624] [2025-01-09 20:59:34,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:34,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:34,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:34,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721440624] [2025-01-09 20:59:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721440624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208565056] [2025-01-09 20:59:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:34,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:34,848 INFO L87 Difference]: Start difference. First operand 463 states and 615 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-01-09 20:59:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:35,156 INFO L93 Difference]: Finished difference Result 889 states and 1192 transitions. [2025-01-09 20:59:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:35,157 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-01-09 20:59:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:35,160 INFO L225 Difference]: With dead ends: 889 [2025-01-09 20:59:35,160 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 20:59:35,162 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-01-09 20:59:35,163 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 11 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:35,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2735 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 20:59:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2025-01-09 20:59:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.332579185520362) internal successors, (589), 447 states have internal predecessors, (589), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 614 transitions. [2025-01-09 20:59:35,181 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 614 transitions. Word has length 71 [2025-01-09 20:59:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:35,181 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 614 transitions. [2025-01-09 20:59:35,181 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-01-09 20:59:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 614 transitions. [2025-01-09 20:59:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:35,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:35,184 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-01-09 20:59:35,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:59:35,184 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-01-09 20:59:35,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash -26733591, now seen corresponding path program 1 times [2025-01-09 20:59:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334548860] [2025-01-09 20:59:35,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:35,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:35,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334548860] [2025-01-09 20:59:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334548860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511209836] [2025-01-09 20:59:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:35,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:35,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:35,428 INFO L87 Difference]: Start difference. First operand 463 states and 614 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-01-09 20:59:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:35,758 INFO L93 Difference]: Finished difference Result 887 states and 1190 transitions. [2025-01-09 20:59:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:35,760 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-01-09 20:59:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:35,763 INFO L225 Difference]: With dead ends: 887 [2025-01-09 20:59:35,765 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 20:59:35,766 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-01-09 20:59:35,766 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 8 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:35,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2694 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 20:59:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-01-09 20:59:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 445 states have (on average 1.3303370786516855) internal successors, (592), 450 states have internal predecessors, (592), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2025-01-09 20:59:35,782 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 71 [2025-01-09 20:59:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:35,782 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2025-01-09 20:59:35,782 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-01-09 20:59:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2025-01-09 20:59:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:35,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:35,787 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-01-09 20:59:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:59:35,787 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-01-09 20:59:35,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 535414226, now seen corresponding path program 1 times [2025-01-09 20:59:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688331716] [2025-01-09 20:59:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:35,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:35,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688331716] [2025-01-09 20:59:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688331716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960511272] [2025-01-09 20:59:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:36,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:36,244 INFO L87 Difference]: Start difference. First operand 466 states and 617 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-01-09 20:59:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:36,798 INFO L93 Difference]: Finished difference Result 902 states and 1209 transitions. [2025-01-09 20:59:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:36,798 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-01-09 20:59:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:36,801 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:59:36,802 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 20:59:36,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:36,803 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 13 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4054 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:36,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4054 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:59:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 20:59:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2025-01-09 20:59:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 449 states have (on average 1.329621380846325) internal successors, (597), 454 states have internal predecessors, (597), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 622 transitions. [2025-01-09 20:59:36,836 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 622 transitions. Word has length 72 [2025-01-09 20:59:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:36,836 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 622 transitions. [2025-01-09 20:59:36,837 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-01-09 20:59:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 622 transitions. [2025-01-09 20:59:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:36,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:36,838 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-01-09 20:59:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:59:36,839 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-01-09 20:59:36,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1830979393, now seen corresponding path program 1 times [2025-01-09 20:59:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819212287] [2025-01-09 20:59:36,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:36,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:36,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:36,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:36,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819212287] [2025-01-09 20:59:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819212287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:37,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:59:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906744569] [2025-01-09 20:59:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:37,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:59:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:37,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:59:37,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:59:37,126 INFO L87 Difference]: Start difference. First operand 470 states and 622 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-01-09 20:59:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:37,652 INFO L93 Difference]: Finished difference Result 911 states and 1219 transitions. [2025-01-09 20:59:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:37,653 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-01-09 20:59:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:37,656 INFO L225 Difference]: With dead ends: 911 [2025-01-09 20:59:37,656 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 20:59:37,657 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-01-09 20:59:37,658 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 26 mSDsluCounter, 4064 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4569 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:59:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 20:59:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2025-01-09 20:59:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 452 states have (on average 1.3274336283185841) internal successors, (600), 457 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 625 transitions. [2025-01-09 20:59:37,682 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 625 transitions. Word has length 72 [2025-01-09 20:59:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:37,682 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 625 transitions. [2025-01-09 20:59:37,683 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-01-09 20:59:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 625 transitions. [2025-01-09 20:59:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:37,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:37,684 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-01-09 20:59:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:59:37,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1429459382, now seen corresponding path program 1 times [2025-01-09 20:59:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12048701] [2025-01-09 20:59:37,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:37,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:37,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:37,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:37,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12048701] [2025-01-09 20:59:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12048701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:38,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:38,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:38,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330533224] [2025-01-09 20:59:38,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:38,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:38,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:38,145 INFO L87 Difference]: Start difference. First operand 473 states and 625 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-01-09 20:59:41,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:59:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:42,503 INFO L93 Difference]: Finished difference Result 914 states and 1219 transitions. [2025-01-09 20:59:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:42,503 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-01-09 20:59:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:42,507 INFO L225 Difference]: With dead ends: 914 [2025-01-09 20:59:42,507 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 20:59:42,508 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-01-09 20:59:42,509 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 44 mSDsluCounter, 3515 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:42,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4021 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 20:59:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 20:59:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 474. [2025-01-09 20:59:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 453 states have (on average 1.3267108167770418) internal successors, (601), 458 states have internal predecessors, (601), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 626 transitions. [2025-01-09 20:59:42,526 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 626 transitions. Word has length 72 [2025-01-09 20:59:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 626 transitions. [2025-01-09 20:59:42,527 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-01-09 20:59:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 626 transitions. [2025-01-09 20:59:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:42,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:42,528 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-01-09 20:59:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:59:42,528 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:42,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -407003538, now seen corresponding path program 1 times [2025-01-09 20:59:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362044363] [2025-01-09 20:59:42,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:42,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:42,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362044363] [2025-01-09 20:59:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362044363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:42,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629650985] [2025-01-09 20:59:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:42,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:42,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:42,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:42,753 INFO L87 Difference]: Start difference. First operand 474 states and 626 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-01-09 20:59:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:43,227 INFO L93 Difference]: Finished difference Result 919 states and 1226 transitions. [2025-01-09 20:59:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:43,228 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-01-09 20:59:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:43,230 INFO L225 Difference]: With dead ends: 919 [2025-01-09 20:59:43,230 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 20:59:43,232 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-01-09 20:59:43,234 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 33 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:43,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3611 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:59:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 20:59:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2025-01-09 20:59:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3288888888888888) internal successors, (598), 455 states have internal predecessors, (598), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 20:59:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 623 transitions. [2025-01-09 20:59:43,257 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 623 transitions. Word has length 72 [2025-01-09 20:59:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 623 transitions. [2025-01-09 20:59:43,257 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-01-09 20:59:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 623 transitions. [2025-01-09 20:59:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:43,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:43,258 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-01-09 20:59:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:59:43,258 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:43,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1009994742, now seen corresponding path program 1 times [2025-01-09 20:59:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719925334] [2025-01-09 20:59:43,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:43,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:43,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:55,363 WARN L286 SmtUtils]: Spent 8.02s 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-01-09 21:00:33,757 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 21:00:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:00:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719925334] [2025-01-09 21:00:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719925334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 21:00:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125817941] [2025-01-09 21:00:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:45,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:00:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:45,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:00:45,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=81, Unknown=7, NotChecked=0, Total=110 [2025-01-09 21:00:45,847 INFO L87 Difference]: Start difference. First operand 471 states and 623 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)