./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.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_SAX_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:55:19,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:55:19,455 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:55:19,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:55:19,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:55:19,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:55:19,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:55:19,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:55:19,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:55:19,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:55:19,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:55:19,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:55:19,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:55:19,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:55:19,492 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:55:19,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:55:19,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:55:19,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:55:19,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:55:19,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:55:19,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:55:19,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:55:19,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:55:19,496 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2025-01-09 20:55:19,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:55:19,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:55:19,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:55:19,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:55:19,786 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:55:19,788 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_SAX_test6-2.i [2025-01-09 20:55:21,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c719433/e992320ea57a4d3ab8ef1b8df856c67f/FLAG58b204546 [2025-01-09 20:55:21,473 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:55:21,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2025-01-09 20:55:21,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c719433/e992320ea57a4d3ab8ef1b8df856c67f/FLAG58b204546 [2025-01-09 20:55:21,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c719433/e992320ea57a4d3ab8ef1b8df856c67f [2025-01-09 20:55:21,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:55:21,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:55:21,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:55:21,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:55:21,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:55:21,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:55:21" (1/1) ... [2025-01-09 20:55:21,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c06fbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:21, skipping insertion in model container [2025-01-09 20:55:21,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:55:21" (1/1) ... [2025-01-09 20:55:21,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:55:22,028 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_SAX_test6-2.i[44118,44131] [2025-01-09 20:55:22,046 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_SAX_test6-2.i[44660,44673] [2025-01-09 20:55:22,152 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_SAX_test6-2.i[56247,56260] [2025-01-09 20:55:22,153 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_SAX_test6-2.i[56368,56381] [2025-01-09 20:55:22,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:55:22,183 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:55:22,238 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_SAX_test6-2.i[44118,44131] [2025-01-09 20:55:22,240 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_SAX_test6-2.i[44660,44673] [2025-01-09 20:55:22,319 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_SAX_test6-2.i[56247,56260] [2025-01-09 20:55:22,320 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_SAX_test6-2.i[56368,56381] [2025-01-09 20:55:22,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:55:22,400 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:55:22,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22 WrapperNode [2025-01-09 20:55:22,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:55:22,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:55:22,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:55:22,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:55:22,407 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:55:22" (1/1) ... [2025-01-09 20:55:22,434 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:55:22" (1/1) ... [2025-01-09 20:55:22,512 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-01-09 20:55:22,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:55:22,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:55:22,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:55:22,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:55:22,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,658 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2025-01-09 20:55:22,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:55:22,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:55:22,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:55:22,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:55:22,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (1/1) ... [2025-01-09 20:55:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:55:22,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:22,848 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:55:22,853 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:55:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:55:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:55:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:55:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:55:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:55:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:55:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-01-09 20:55:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-01-09 20:55:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:55:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:55:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:55:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:55:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:55:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:55:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:55:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-01-09 20:55:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-01-09 20:55:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:55:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:55:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:55:23,099 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:55:23,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:55:24,592 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-01-09 20:55:24,592 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:55:24,616 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:55:24,620 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 20:55:24,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:24 BoogieIcfgContainer [2025-01-09 20:55:24,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:55:24,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:55:24,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:55:24,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:55:24,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:55:21" (1/3) ... [2025-01-09 20:55:24,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee66236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:24, skipping insertion in model container [2025-01-09 20:55:24,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:22" (2/3) ... [2025-01-09 20:55:24,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee66236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:24, skipping insertion in model container [2025-01-09 20:55:24,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:24" (3/3) ... [2025-01-09 20:55:24,630 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2025-01-09 20:55:24,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:55:24,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-2.i that has 5 procedures, 470 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2025-01-09 20:55:24,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:55:24,710 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;@b36f473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:55:24,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 20:55:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 446 states have (on average 1.5896860986547086) internal successors, (709), 450 states have internal predecessors, (709), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:55:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 20:55:24,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:24,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:55:24,721 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:55:24,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1883014248, now seen corresponding path program 1 times [2025-01-09 20:55:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637039750] [2025-01-09 20:55:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:24,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 20:55:24,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 20:55:24,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:24,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:24,912 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:55:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637039750] [2025-01-09 20:55:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637039750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:24,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:55:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212436368] [2025-01-09 20:55:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:24,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:55:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:24,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:55:24,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:55:24,939 INFO L87 Difference]: Start difference. First operand has 470 states, 446 states have (on average 1.5896860986547086) internal successors, (709), 450 states have internal predecessors, (709), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:25,034 INFO L93 Difference]: Finished difference Result 936 states and 1489 transitions. [2025-01-09 20:55:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:55:25,036 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:55:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:25,049 INFO L225 Difference]: With dead ends: 936 [2025-01-09 20:55:25,049 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 20:55:25,057 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:55:25,060 INFO L435 NwaCegarLoop]: 664 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, 664 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:55:25,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 20:55:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-01-09 20:55:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 442 states have (on average 1.4276018099547512) internal successors, (631), 446 states have internal predecessors, (631), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 661 transitions. [2025-01-09 20:55:25,137 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 661 transitions. Word has length 8 [2025-01-09 20:55:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 661 transitions. [2025-01-09 20:55:25,138 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:55:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 661 transitions. [2025-01-09 20:55:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 20:55:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:25,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:55:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:55:25,140 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:55:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1883663023, now seen corresponding path program 1 times [2025-01-09 20:55:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527129319] [2025-01-09 20:55:25,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:25,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 20:55:25,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 20:55:25,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:25,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:25,388 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:55:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527129319] [2025-01-09 20:55:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527129319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:55:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522125653] [2025-01-09 20:55:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:25,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:25,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:55:25,392 INFO L87 Difference]: Start difference. First operand 465 states and 661 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:55:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:25,601 INFO L93 Difference]: Finished difference Result 1152 states and 1648 transitions. [2025-01-09 20:55:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:25,602 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:55:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:25,607 INFO L225 Difference]: With dead ends: 1152 [2025-01-09 20:55:25,608 INFO L226 Difference]: Without dead ends: 903 [2025-01-09 20:55:25,609 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:55:25,610 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 604 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:25,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2014 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-09 20:55:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 467. [2025-01-09 20:55:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 448 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2025-01-09 20:55:25,661 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 10 [2025-01-09 20:55:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2025-01-09 20:55:25,661 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:55:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2025-01-09 20:55:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:55:25,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:25,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:55:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:55:25,664 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:55:25,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash -546527626, now seen corresponding path program 1 times [2025-01-09 20:55:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:25,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100744685] [2025-01-09 20:55:25,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:25,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:55:25,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:55:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:26,014 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:55:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100744685] [2025-01-09 20:55:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100744685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:55:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218288175] [2025-01-09 20:55:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:26,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:26,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:26,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:55:26,016 INFO L87 Difference]: Start difference. First operand 467 states and 663 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:55:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:26,133 INFO L93 Difference]: Finished difference Result 888 states and 1256 transitions. [2025-01-09 20:55:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:55:26,135 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:55:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:26,138 INFO L225 Difference]: With dead ends: 888 [2025-01-09 20:55:26,140 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 20:55:26,141 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:55:26,142 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 30 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1661 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:55:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1661 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 20:55:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-09 20:55:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.3830845771144278) internal successors, (556), 406 states have internal predecessors, (556), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 586 transitions. [2025-01-09 20:55:26,166 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 586 transitions. Word has length 66 [2025-01-09 20:55:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:26,166 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 586 transitions. [2025-01-09 20:55:26,166 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:55:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 586 transitions. [2025-01-09 20:55:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:55:26,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:26,169 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:55:26,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:55:26,170 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:55:26,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1513782506, now seen corresponding path program 1 times [2025-01-09 20:55:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:26,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105814523] [2025-01-09 20:55:26,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:55:26,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:55:26,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:26,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:26,458 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:55:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105814523] [2025-01-09 20:55:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105814523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:26,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675370012] [2025-01-09 20:55:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:26,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:26,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:26,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:26,461 INFO L87 Difference]: Start difference. First operand 425 states and 586 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:55:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:26,512 INFO L93 Difference]: Finished difference Result 846 states and 1168 transitions. [2025-01-09 20:55:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:26,512 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:55:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:26,515 INFO L225 Difference]: With dead ends: 846 [2025-01-09 20:55:26,515 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 20:55:26,516 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:55:26,518 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1122 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:55:26,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1122 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 20:55:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-09 20:55:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.3756218905472637) internal successors, (553), 406 states have internal predecessors, (553), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 583 transitions. [2025-01-09 20:55:26,539 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 583 transitions. Word has length 66 [2025-01-09 20:55:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:26,539 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 583 transitions. [2025-01-09 20:55:26,540 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:55:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 583 transitions. [2025-01-09 20:55:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:55:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:26,543 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:55:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:55:26,544 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:55:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -537201492, now seen corresponding path program 1 times [2025-01-09 20:55:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702554650] [2025-01-09 20:55:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:26,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:55:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:55:26,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:26,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:26,972 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:55:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702554650] [2025-01-09 20:55:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702554650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:55:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012245939] [2025-01-09 20:55:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:55:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:26,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:55:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:26,978 INFO L87 Difference]: Start difference. First operand 425 states and 583 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:55:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:27,336 INFO L93 Difference]: Finished difference Result 851 states and 1170 transitions. [2025-01-09 20:55:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:55:27,336 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:55:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:27,339 INFO L225 Difference]: With dead ends: 851 [2025-01-09 20:55:27,339 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 20:55:27,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:27,344 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 14 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2519 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:55:27,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2519 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 20:55:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2025-01-09 20:55:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.3737623762376239) internal successors, (555), 408 states have internal predecessors, (555), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 585 transitions. [2025-01-09 20:55:27,377 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 585 transitions. Word has length 66 [2025-01-09 20:55:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 585 transitions. [2025-01-09 20:55:27,378 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:55:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 585 transitions. [2025-01-09 20:55:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:55:27,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:27,382 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:55:27,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:55:27,383 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:55:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2064890107, now seen corresponding path program 1 times [2025-01-09 20:55:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121333503] [2025-01-09 20:55:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:27,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:55:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:55:27,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:27,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:27,697 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:55:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121333503] [2025-01-09 20:55:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121333503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:55:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8895332] [2025-01-09 20:55:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:27,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:27,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:27,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:27,699 INFO L87 Difference]: Start difference. First operand 427 states and 585 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:55:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:28,049 INFO L93 Difference]: Finished difference Result 855 states and 1174 transitions. [2025-01-09 20:55:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:55:28,050 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:55:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:28,054 INFO L225 Difference]: With dead ends: 855 [2025-01-09 20:55:28,054 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 20:55:28,055 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:55:28,056 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 15 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3023 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:55:28,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3023 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 20:55:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 431. [2025-01-09 20:55:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3725490196078431) internal successors, (560), 412 states have internal predecessors, (560), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 590 transitions. [2025-01-09 20:55:28,077 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 590 transitions. Word has length 67 [2025-01-09 20:55:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:28,077 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 590 transitions. [2025-01-09 20:55:28,078 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:55:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 590 transitions. [2025-01-09 20:55:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:55:28,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:28,079 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:55:28,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:55:28,079 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:55:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -395471473, now seen corresponding path program 1 times [2025-01-09 20:55:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:28,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015208454] [2025-01-09 20:55:28,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:28,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:55:28,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:55:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:28,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:28,387 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:55:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015208454] [2025-01-09 20:55:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015208454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:28,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:55:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966494341] [2025-01-09 20:55:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:28,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:28,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:55:28,389 INFO L87 Difference]: Start difference. First operand 431 states and 590 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:55:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:28,505 INFO L93 Difference]: Finished difference Result 858 states and 1176 transitions. [2025-01-09 20:55:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:28,505 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:55:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:28,508 INFO L225 Difference]: With dead ends: 858 [2025-01-09 20:55:28,508 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 20:55:28,509 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:55:28,510 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 17 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1576 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:55:28,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1576 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 20:55:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 20:55:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3700980392156863) internal successors, (559), 412 states have internal predecessors, (559), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 589 transitions. [2025-01-09 20:55:28,524 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 589 transitions. Word has length 67 [2025-01-09 20:55:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:28,524 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 589 transitions. [2025-01-09 20:55:28,524 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:55:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 589 transitions. [2025-01-09 20:55:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:55:28,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:28,525 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:55:28,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:55:28,525 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:55:28,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1316778760, now seen corresponding path program 1 times [2025-01-09 20:55:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692913762] [2025-01-09 20:55:28,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:28,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:55:28,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:55:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:28,948 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:55:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692913762] [2025-01-09 20:55:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692913762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:55:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577526952] [2025-01-09 20:55:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:55:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:28,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:55:28,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:55:28,952 INFO L87 Difference]: Start difference. First operand 431 states and 589 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:55:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:29,419 INFO L93 Difference]: Finished difference Result 871 states and 1195 transitions. [2025-01-09 20:55:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:55:29,420 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:55:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:29,423 INFO L225 Difference]: With dead ends: 871 [2025-01-09 20:55:29,423 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 20:55:29,424 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:55:29,425 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 33 mSDsluCounter, 3521 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4079 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:55:29,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4079 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 20:55:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2025-01-09 20:55:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 418 states have (on average 1.3708133971291867) internal successors, (573), 422 states have internal predecessors, (573), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 603 transitions. [2025-01-09 20:55:29,441 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 603 transitions. Word has length 68 [2025-01-09 20:55:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:29,442 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 603 transitions. [2025-01-09 20:55:29,442 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:55:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 603 transitions. [2025-01-09 20:55:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:55:29,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:29,443 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:55:29,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:55:29,444 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:55:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 295892241, now seen corresponding path program 1 times [2025-01-09 20:55:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414345102] [2025-01-09 20:55:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:29,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:55:29,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:55:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:29,878 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:55:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414345102] [2025-01-09 20:55:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414345102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:29,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:55:29,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927806242] [2025-01-09 20:55:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:29,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:55:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:29,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:55:29,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:55:29,880 INFO L87 Difference]: Start difference. First operand 441 states and 603 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:55:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:30,282 INFO L93 Difference]: Finished difference Result 881 states and 1207 transitions. [2025-01-09 20:55:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:55:30,283 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:55:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:30,285 INFO L225 Difference]: With dead ends: 881 [2025-01-09 20:55:30,285 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 20:55:30,286 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:55:30,287 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 27 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3571 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:30,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3571 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 20:55:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-09 20:55:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 421 states have (on average 1.368171021377672) internal successors, (576), 425 states have internal predecessors, (576), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 606 transitions. [2025-01-09 20:55:30,301 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 606 transitions. Word has length 68 [2025-01-09 20:55:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 606 transitions. [2025-01-09 20:55:30,301 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:55:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 606 transitions. [2025-01-09 20:55:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:55:30,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:30,302 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:55:30,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:55:30,303 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:55:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1457191505, now seen corresponding path program 1 times [2025-01-09 20:55:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298053191] [2025-01-09 20:55:30,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:30,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:55:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:55:30,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:30,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:30,516 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:55:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298053191] [2025-01-09 20:55:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298053191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:55:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347919583] [2025-01-09 20:55:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:55:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:55:30,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:30,518 INFO L87 Difference]: Start difference. First operand 444 states and 606 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:55:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:30,771 INFO L93 Difference]: Finished difference Result 887 states and 1213 transitions. [2025-01-09 20:55:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:55:30,772 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:55:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:30,774 INFO L225 Difference]: With dead ends: 887 [2025-01-09 20:55:30,774 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 20:55:30,776 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:55:30,777 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 8 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2541 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:55:30,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2541 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:55:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 20:55:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-01-09 20:55:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 424 states have (on average 1.365566037735849) internal successors, (579), 428 states have internal predecessors, (579), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 609 transitions. [2025-01-09 20:55:30,790 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 609 transitions. Word has length 68 [2025-01-09 20:55:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:30,790 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 609 transitions. [2025-01-09 20:55:30,790 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:55:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 609 transitions. [2025-01-09 20:55:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:55:30,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:30,791 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:55:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:55:30,791 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:55:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -924128962, now seen corresponding path program 1 times [2025-01-09 20:55:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521698986] [2025-01-09 20:55:30,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:55:30,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:55:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:31,344 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:55:31,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521698986] [2025-01-09 20:55:31,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521698986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:31,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:55:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405793934] [2025-01-09 20:55:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:31,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:55:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:31,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:55:31,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:55:31,347 INFO L87 Difference]: Start difference. First operand 447 states and 609 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:55:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:32,485 INFO L93 Difference]: Finished difference Result 1295 states and 1777 transitions. [2025-01-09 20:55:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:32,486 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:55:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:32,490 INFO L225 Difference]: With dead ends: 1295 [2025-01-09 20:55:32,490 INFO L226 Difference]: Without dead ends: 852 [2025-01-09 20:55:32,491 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:55:32,491 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 675 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 4145 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:32,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 4145 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 20:55:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-01-09 20:55:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 485. [2025-01-09 20:55:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 466 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2025-01-09 20:55:32,512 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 69 [2025-01-09 20:55:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:32,512 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2025-01-09 20:55:32,512 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:55:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2025-01-09 20:55:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:55:32,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:32,513 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:55:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:55:32,513 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:55:32,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -187398510, now seen corresponding path program 1 times [2025-01-09 20:55:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071467877] [2025-01-09 20:55:32,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:32,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:55:32,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:55:32,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:32,735 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:55:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071467877] [2025-01-09 20:55:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071467877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:55:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265816843] [2025-01-09 20:55:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:32,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:32,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:32,737 INFO L87 Difference]: Start difference. First operand 485 states and 648 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:55:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:33,058 INFO L93 Difference]: Finished difference Result 933 states and 1261 transitions. [2025-01-09 20:55:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:55:33,058 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:55:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:33,061 INFO L225 Difference]: With dead ends: 933 [2025-01-09 20:55:33,061 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 20:55:33,062 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:55:33,063 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 12 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3030 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:55:33,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3030 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 20:55:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2025-01-09 20:55:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 466 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2025-01-09 20:55:33,080 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 69 [2025-01-09 20:55:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2025-01-09 20:55:33,083 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:55:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2025-01-09 20:55:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:55:33,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:33,084 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:55:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:55:33,084 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:55:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -260522659, now seen corresponding path program 1 times [2025-01-09 20:55:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693961108] [2025-01-09 20:55:33,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:33,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:55:33,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:55:33,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:33,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:33,327 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:55:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:33,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693961108] [2025-01-09 20:55:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693961108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:55:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460049035] [2025-01-09 20:55:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:33,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:55:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:33,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:55:33,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:55:33,329 INFO L87 Difference]: Start difference. First operand 485 states and 648 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:55:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:33,629 INFO L93 Difference]: Finished difference Result 938 states and 1267 transitions. [2025-01-09 20:55:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:55:33,630 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:55:33,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:33,633 INFO L225 Difference]: With dead ends: 938 [2025-01-09 20:55:33,633 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 20:55:33,634 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:55:33,635 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 20 mSDsluCounter, 3054 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3611 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:55:33,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3611 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 20:55:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 488. [2025-01-09 20:55:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2025-01-09 20:55:33,652 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 70 [2025-01-09 20:55:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:33,652 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2025-01-09 20:55:33,652 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:55:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2025-01-09 20:55:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:55:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:33,654 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:55:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:55:33,654 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:55:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1876718145, now seen corresponding path program 1 times [2025-01-09 20:55:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155280794] [2025-01-09 20:55:33,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:55:33,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:55:33,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:33,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:33,932 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:55:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155280794] [2025-01-09 20:55:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155280794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:55:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717067172] [2025-01-09 20:55:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:55:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:33,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:55:33,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:55:33,933 INFO L87 Difference]: Start difference. First operand 488 states and 652 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:55:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:34,401 INFO L93 Difference]: Finished difference Result 948 states and 1279 transitions. [2025-01-09 20:55:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:34,401 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:55:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:34,405 INFO L225 Difference]: With dead ends: 948 [2025-01-09 20:55:34,405 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 20:55:34,406 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:55:34,406 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 37 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4035 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:55:34,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4035 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 20:55:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2025-01-09 20:55:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2025-01-09 20:55:34,425 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 70 [2025-01-09 20:55:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:34,425 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2025-01-09 20:55:34,425 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:55:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2025-01-09 20:55:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:55:34,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:34,426 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:55:34,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:55:34,427 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:55:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -495464894, now seen corresponding path program 1 times [2025-01-09 20:55:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569073646] [2025-01-09 20:55:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:34,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:55:34,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:55:34,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:34,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:34,715 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:55:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569073646] [2025-01-09 20:55:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569073646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:55:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781414346] [2025-01-09 20:55:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:55:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:34,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:55:34,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:55:34,717 INFO L87 Difference]: Start difference. First operand 488 states and 652 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:55:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:35,164 INFO L93 Difference]: Finished difference Result 950 states and 1284 transitions. [2025-01-09 20:55:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:35,164 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:55:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:35,167 INFO L225 Difference]: With dead ends: 950 [2025-01-09 20:55:35,167 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:55:35,169 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:55:35,170 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 23 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4099 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:55:35,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4099 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:55:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-01-09 20:55:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 475 states have (on average 1.3347368421052632) internal successors, (634), 479 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 664 transitions. [2025-01-09 20:55:35,190 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 664 transitions. Word has length 71 [2025-01-09 20:55:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:35,190 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 664 transitions. [2025-01-09 20:55:35,191 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:55:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 664 transitions. [2025-01-09 20:55:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:55:35,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:35,192 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:55:35,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:55:35,193 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:55:35,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1334490590, now seen corresponding path program 1 times [2025-01-09 20:55:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:35,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877577457] [2025-01-09 20:55:35,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:35,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:55:35,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:55:35,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:35,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:35,498 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:55:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877577457] [2025-01-09 20:55:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877577457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:55:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357249462] [2025-01-09 20:55:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:55:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:35,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:55:35,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:55:35,502 INFO L87 Difference]: Start difference. First operand 498 states and 664 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:55:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:35,991 INFO L93 Difference]: Finished difference Result 970 states and 1308 transitions. [2025-01-09 20:55:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:35,991 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:55:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:35,994 INFO L225 Difference]: With dead ends: 970 [2025-01-09 20:55:35,994 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 20:55:35,995 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:55:35,995 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 17 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4547 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:55:35,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4547 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 20:55:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 501. [2025-01-09 20:55:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3347280334728033) internal successors, (638), 482 states have internal predecessors, (638), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 668 transitions. [2025-01-09 20:55:36,010 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 668 transitions. Word has length 71 [2025-01-09 20:55:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:36,010 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 668 transitions. [2025-01-09 20:55:36,011 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:55:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 668 transitions. [2025-01-09 20:55:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:55:36,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:36,012 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:55:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:55:36,012 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:55:36,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash -163562146, now seen corresponding path program 1 times [2025-01-09 20:55:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748027957] [2025-01-09 20:55:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:36,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:55:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:55:36,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:36,274 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:55:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748027957] [2025-01-09 20:55:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748027957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:36,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:55:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102997057] [2025-01-09 20:55:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:36,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:36,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:36,277 INFO L87 Difference]: Start difference. First operand 501 states and 668 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:55:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:36,561 INFO L93 Difference]: Finished difference Result 965 states and 1298 transitions. [2025-01-09 20:55:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:55:36,562 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:55:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:36,565 INFO L225 Difference]: With dead ends: 965 [2025-01-09 20:55:36,565 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 20:55:36,566 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:55:36,566 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 11 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3053 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:55:36,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3053 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 20:55:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2025-01-09 20:55:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3326359832635983) internal successors, (637), 482 states have internal predecessors, (637), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 667 transitions. [2025-01-09 20:55:36,587 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 667 transitions. Word has length 71 [2025-01-09 20:55:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 667 transitions. [2025-01-09 20:55:36,588 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:55:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 667 transitions. [2025-01-09 20:55:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:55:36,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:36,591 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:55:36,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:55:36,591 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:55:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1449108855, now seen corresponding path program 1 times [2025-01-09 20:55:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823973895] [2025-01-09 20:55:36,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:36,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:55:36,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:55:36,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:36,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:36,821 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:55:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823973895] [2025-01-09 20:55:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823973895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:55:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673345349] [2025-01-09 20:55:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:36,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:36,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:36,824 INFO L87 Difference]: Start difference. First operand 501 states and 667 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:55:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:37,148 INFO L93 Difference]: Finished difference Result 963 states and 1296 transitions. [2025-01-09 20:55:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:55:37,149 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:55:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:37,152 INFO L225 Difference]: With dead ends: 963 [2025-01-09 20:55:37,153 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:55:37,154 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:55:37,155 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 8 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3012 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:55:37,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3012 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:55:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:55:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:55:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 481 states have (on average 1.3305613305613306) internal successors, (640), 485 states have internal predecessors, (640), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 670 transitions. [2025-01-09 20:55:37,173 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 670 transitions. Word has length 71 [2025-01-09 20:55:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:37,173 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 670 transitions. [2025-01-09 20:55:37,173 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:55:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 670 transitions. [2025-01-09 20:55:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:55:37,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:37,178 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:55:37,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:55:37,178 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:55:37,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2011256672, now seen corresponding path program 1 times [2025-01-09 20:55:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052098787] [2025-01-09 20:55:37,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:37,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:55:37,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:55:37,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:37,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:37,617 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:55:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052098787] [2025-01-09 20:55:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052098787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:37,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:55:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080351906] [2025-01-09 20:55:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:37,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:55:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:37,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:55:37,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:55:37,618 INFO L87 Difference]: Start difference. First operand 504 states and 670 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:55:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:38,105 INFO L93 Difference]: Finished difference Result 978 states and 1315 transitions. [2025-01-09 20:55:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:38,105 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:55:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:38,108 INFO L225 Difference]: With dead ends: 978 [2025-01-09 20:55:38,109 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 20:55:38,109 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:55:38,110 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 13 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:38,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4059 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:55:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 20:55:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 508. [2025-01-09 20:55:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3298969072164948) internal successors, (645), 489 states have internal predecessors, (645), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 675 transitions. [2025-01-09 20:55:38,139 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 675 transitions. Word has length 72 [2025-01-09 20:55:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:38,139 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 675 transitions. [2025-01-09 20:55:38,140 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:55:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 675 transitions. [2025-01-09 20:55:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:55:38,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:38,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, 1, 1, 1, 1] [2025-01-09 20:55:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:55:38,141 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:55:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -355136947, now seen corresponding path program 1 times [2025-01-09 20:55:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617200772] [2025-01-09 20:55:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:38,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:55:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:55:38,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:38,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:38,439 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:55:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:38,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617200772] [2025-01-09 20:55:38,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617200772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:38,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:38,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:55:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567482167] [2025-01-09 20:55:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:38,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:55:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:38,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:55:38,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:55:38,441 INFO L87 Difference]: Start difference. First operand 508 states and 675 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:55:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:38,904 INFO L93 Difference]: Finished difference Result 987 states and 1325 transitions. [2025-01-09 20:55:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:38,905 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:55:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:38,908 INFO L225 Difference]: With dead ends: 987 [2025-01-09 20:55:38,908 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 20:55:38,909 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:55:38,910 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 40 mSDsluCounter, 4019 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4577 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:38,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4577 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 20:55:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2025-01-09 20:55:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 488 states have (on average 1.3278688524590163) internal successors, (648), 492 states have internal predecessors, (648), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 678 transitions. [2025-01-09 20:55:38,932 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 678 transitions. Word has length 72 [2025-01-09 20:55:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:38,933 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 678 transitions. [2025-01-09 20:55:38,933 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:55:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2025-01-09 20:55:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:55:38,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:38,934 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:55:38,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:55:38,934 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:55:38,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1389665468, now seen corresponding path program 1 times [2025-01-09 20:55:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:38,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571009717] [2025-01-09 20:55:38,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:38,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:55:38,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:55:38,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:39,418 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:55:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571009717] [2025-01-09 20:55:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571009717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:55:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440014472] [2025-01-09 20:55:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:39,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:55:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:55:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:55:39,421 INFO L87 Difference]: Start difference. First operand 511 states and 678 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:55:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:40,588 INFO L93 Difference]: Finished difference Result 990 states and 1325 transitions. [2025-01-09 20:55:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:40,589 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:55:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:40,592 INFO L225 Difference]: With dead ends: 990 [2025-01-09 20:55:40,592 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 20:55:40,593 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:55:40,594 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 44 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:40,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4005 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 20:55:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 20:55:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 512. [2025-01-09 20:55:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 489 states have (on average 1.32719836400818) internal successors, (649), 493 states have internal predecessors, (649), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 679 transitions. [2025-01-09 20:55:40,612 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 679 transitions. Word has length 72 [2025-01-09 20:55:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:40,612 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 679 transitions. [2025-01-09 20:55:40,612 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:55:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 679 transitions. [2025-01-09 20:55:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:55:40,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:40,613 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:55:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:55:40,613 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:55:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1068838908, now seen corresponding path program 1 times [2025-01-09 20:55:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000251037] [2025-01-09 20:55:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:40,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:55:40,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:55:40,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:40,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:40,853 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:55:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000251037] [2025-01-09 20:55:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000251037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:40,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:40,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:55:40,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84816198] [2025-01-09 20:55:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:55:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:55:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:55:40,856 INFO L87 Difference]: Start difference. First operand 512 states and 679 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:55:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:41,345 INFO L93 Difference]: Finished difference Result 995 states and 1332 transitions. [2025-01-09 20:55:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:55:41,346 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:55:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:41,349 INFO L225 Difference]: With dead ends: 995 [2025-01-09 20:55:41,349 INFO L226 Difference]: Without dead ends: 525 [2025-01-09 20:55:41,351 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:55:41,352 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 33 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4035 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:55:41,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4035 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:55:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-01-09 20:55:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 509. [2025-01-09 20:55:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 486 states have (on average 1.3292181069958848) internal successors, (646), 490 states have internal predecessors, (646), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:55:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2025-01-09 20:55:41,371 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 72 [2025-01-09 20:55:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:41,372 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2025-01-09 20:55:41,372 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:55:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2025-01-09 20:55:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:55:41,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:41,373 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:55:41,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:55:41,373 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:55:41,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 465847704, now seen corresponding path program 1 times [2025-01-09 20:55:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336790445] [2025-01-09 20:55:41,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:55:41,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:55:41,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:41,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:53,841 WARN L286 SmtUtils]: Spent 8.03s 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 20:56:05,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-01-09 20:56:05,916 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:56:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336790445] [2025-01-09 20:56:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336790445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:05,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:05,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:56:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959568679] [2025-01-09 20:56:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:05,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:56:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:05,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:56:05,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-01-09 20:56:05,917 INFO L87 Difference]: Start difference. First operand 509 states and 676 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:56:10,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:14,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:18,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:22,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:26,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:30,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:34,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:38,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-01-09 20:56:41,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:42,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:45,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:56:50,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []