./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:01:51,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:01:51,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:01:51,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:01:51,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:01:51,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:01:51,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:01:51,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:01:51,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:01:51,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:01:51,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:01:51,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:01:51,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:01:51,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:01:51,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:01:51,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:01:51,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:01:51,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:01:51,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:01:51,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:01:51,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:01:51,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:01:51,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:01:51,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:01:51,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:01:51,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2025-03-04 06:01:51,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:01:51,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:01:51,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:01:51,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:01:51,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:01:51,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2025-03-04 06:01:53,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907b5558/ad789075f56e4f329fffbbcafcf22b1a/FLAG59aa2e4fa [2025-03-04 06:01:54,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:01:54,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2025-03-04 06:01:54,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907b5558/ad789075f56e4f329fffbbcafcf22b1a/FLAG59aa2e4fa [2025-03-04 06:01:54,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907b5558/ad789075f56e4f329fffbbcafcf22b1a [2025-03-04 06:01:54,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:01:54,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:01:54,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:01:54,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:01:54,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:01:54,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:01:54" (1/1) ... [2025-03-04 06:01:54,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab5dea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:54, skipping insertion in model container [2025-03-04 06:01:54,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:01:54" (1/1) ... [2025-03-04 06:01:54,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:01:55,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2025-03-04 06:01:55,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2025-03-04 06:01:55,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2025-03-04 06:01:55,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2025-03-04 06:01:55,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:01:55,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:01:55,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2025-03-04 06:01:55,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2025-03-04 06:01:55,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2025-03-04 06:01:55,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2025-03-04 06:01:55,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:01:55,720 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:01:55,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55 WrapperNode [2025-03-04 06:01:55,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:01:55,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:01:55,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:01:55,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:01:55,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:55,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:55,936 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-03-04 06:01:55,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:01:55,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:01:55,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:01:55,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:01:55,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:55,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:55,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,096 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 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, 57, 4]. [2025-03-04 06:01:56,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:01:56,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:01:56,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:01:56,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:01:56,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (1/1) ... [2025-03-04 06:01:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:01:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:01:56,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:01:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-04 06:01:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-04 06:01:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:01:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:01:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-04 06:01:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-04 06:01:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 06:01:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:01:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:01:56,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:01:56,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:01:56,681 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-04 06:01:57,749 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-04 06:01:57,749 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-04 06:01:57,749 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 06:01:57,817 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-03-04 06:01:57,817 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:01:57,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:01:57,853 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:01:57,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:01:57 BoogieIcfgContainer [2025-03-04 06:01:57,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:01:57,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:01:57,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:01:57,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:01:57,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:01:54" (1/3) ... [2025-03-04 06:01:57,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e0bcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:01:57, skipping insertion in model container [2025-03-04 06:01:57,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:01:55" (2/3) ... [2025-03-04 06:01:57,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e0bcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:01:57, skipping insertion in model container [2025-03-04 06:01:57,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:01:57" (3/3) ... [2025-03-04 06:01:57,863 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2025-03-04 06:01:57,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:01:57,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test6-2.i that has 5 procedures, 466 locations, 1 initial locations, 39 loop locations, and 4 error locations. [2025-03-04 06:01:57,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:01:57,937 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;@3ef3c8ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:01:57,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 06:01:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 442 states have (on average 1.5950226244343892) internal successors, (705), 446 states have internal predecessors, (705), 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-03-04 06:01:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 06:01:57,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:01:57,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:01:57,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:01:57,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:01:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1241237276, now seen corresponding path program 1 times [2025-03-04 06:01:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:01:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145137959] [2025-03-04 06:01:57,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:01:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:01:58,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 06:01:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 06:01:58,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:01:58,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:01:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:01:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:01:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145137959] [2025-03-04 06:01:58,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145137959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:01:58,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:01:58,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:01:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864436562] [2025-03-04 06:01:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:01:58,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:01:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:01:58,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:01:58,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:01:58,120 INFO L87 Difference]: Start difference. First operand has 466 states, 442 states have (on average 1.5950226244343892) internal successors, (705), 446 states have internal predecessors, (705), 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-03-04 06:01:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:01:58,230 INFO L93 Difference]: Finished difference Result 928 states and 1481 transitions. [2025-03-04 06:01:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:01:58,233 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-03-04 06:01:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:01:58,242 INFO L225 Difference]: With dead ends: 928 [2025-03-04 06:01:58,243 INFO L226 Difference]: Without dead ends: 461 [2025-03-04 06:01:58,248 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-03-04 06:01:58,252 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:01:58,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:01:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-04 06:01:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-03-04 06:01:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 438 states have (on average 1.4315068493150684) internal successors, (627), 442 states have internal predecessors, (627), 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-03-04 06:01:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 657 transitions. [2025-03-04 06:01:58,300 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 657 transitions. Word has length 8 [2025-03-04 06:01:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:01:58,300 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 657 transitions. [2025-03-04 06:01:58,301 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-03-04 06:01:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 657 transitions. [2025-03-04 06:01:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 06:01:58,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:01:58,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:01:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:01:58,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:01:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:01:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2079256789, now seen corresponding path program 1 times [2025-03-04 06:01:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:01:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167415774] [2025-03-04 06:01:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:01:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:01:58,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 06:01:58,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 06:01:58,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:01:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:01:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:01:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:01:58,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167415774] [2025-03-04 06:01:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167415774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:01:58,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:01:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:01:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388314609] [2025-03-04 06:01:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:01:58,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:01:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:01:58,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:01:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:01:58,458 INFO L87 Difference]: Start difference. First operand 461 states and 657 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-03-04 06:01:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:01:58,692 INFO L93 Difference]: Finished difference Result 1143 states and 1639 transitions. [2025-03-04 06:01:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:01:58,692 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-03-04 06:01:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:01:58,698 INFO L225 Difference]: With dead ends: 1143 [2025-03-04 06:01:58,699 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 06:01:58,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:01:58,700 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 600 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:01:58,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1855 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:01:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 06:01:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 463. [2025-03-04 06:01:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 440 states have (on average 1.4295454545454545) internal successors, (629), 444 states have internal predecessors, (629), 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-03-04 06:01:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 659 transitions. [2025-03-04 06:01:58,738 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 659 transitions. Word has length 10 [2025-03-04 06:01:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:01:58,739 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 659 transitions. [2025-03-04 06:01:58,739 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-03-04 06:01:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 659 transitions. [2025-03-04 06:01:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:01:58,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:01:58,741 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] [2025-03-04 06:01:58,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:01:58,741 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-03-04 06:01:58,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:01:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1756423654, now seen corresponding path program 1 times [2025-03-04 06:01:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:01:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531608083] [2025-03-04 06:01:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:01:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:01:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:01:58,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:01:58,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:01:58,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:01:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:01:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:01:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531608083] [2025-03-04 06:01:58,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531608083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:01:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:01:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:01:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424153737] [2025-03-04 06:01:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:01:58,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:01:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:01:58,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:01:58,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:01:58,994 INFO L87 Difference]: Start difference. First operand 463 states and 659 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-04 06:01:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:01:59,126 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2025-03-04 06:01:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:01:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2025-03-04 06:01:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:01:59,129 INFO L225 Difference]: With dead ends: 925 [2025-03-04 06:01:59,129 INFO L226 Difference]: Without dead ends: 466 [2025-03-04 06:01:59,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:01:59,132 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 105 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:01:59,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1677 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:01:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-04 06:01:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2025-03-04 06:01:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 440 states have (on average 1.4136363636363636) internal successors, (622), 444 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-03-04 06:01:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 652 transitions. [2025-03-04 06:01:59,145 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 652 transitions. Word has length 64 [2025-03-04 06:01:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:01:59,145 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 652 transitions. [2025-03-04 06:01:59,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-04 06:01:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 652 transitions. [2025-03-04 06:01:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:01:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:01:59,148 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] [2025-03-04 06:01:59,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:01:59,148 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-03-04 06:01:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:01:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1904171213, now seen corresponding path program 1 times [2025-03-04 06:01:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:01:59,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657010958] [2025-03-04 06:01:59,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:01:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:01:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:01:59,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:01:59,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:01:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:01:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:01:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:01:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657010958] [2025-03-04 06:01:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657010958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:01:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:01:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:01:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297593944] [2025-03-04 06:01:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:01:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:01:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:01:59,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:01:59,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:01:59,506 INFO L87 Difference]: Start difference. First operand 463 states and 652 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-03-04 06:02:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:00,056 INFO L93 Difference]: Finished difference Result 956 states and 1345 transitions. [2025-03-04 06:02:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:02:00,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 64 [2025-03-04 06:02:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:00,059 INFO L225 Difference]: With dead ends: 956 [2025-03-04 06:02:00,059 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 06:02:00,060 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-03-04 06:02:00,060 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 14 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2490 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 06:02:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2025-03-04 06:02:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 467 states have (on average 1.4025695931477515) internal successors, (655), 471 states have internal predecessors, (655), 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-03-04 06:02:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 685 transitions. [2025-03-04 06:02:00,072 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 685 transitions. Word has length 64 [2025-03-04 06:02:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:00,072 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 685 transitions. [2025-03-04 06:02:00,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-03-04 06:02:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 685 transitions. [2025-03-04 06:02:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:02:00,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:00,076 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] [2025-03-04 06:02:00,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:02:00,076 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-03-04 06:02:00,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash -805715037, now seen corresponding path program 1 times [2025-03-04 06:02:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:00,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237674382] [2025-03-04 06:02:00,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:00,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:02:00,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:02:00,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:00,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:00,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:00,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237674382] [2025-03-04 06:02:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237674382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:02:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511452926] [2025-03-04 06:02:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:00,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:02:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:00,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:02:00,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:02:00,335 INFO L87 Difference]: Start difference. First operand 490 states and 685 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-03-04 06:02:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:00,548 INFO L93 Difference]: Finished difference Result 985 states and 1380 transitions. [2025-03-04 06:02:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:02:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2025-03-04 06:02:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:00,550 INFO L225 Difference]: With dead ends: 985 [2025-03-04 06:02:00,550 INFO L226 Difference]: Without dead ends: 499 [2025-03-04 06:02:00,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:02:00,555 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 17 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:00,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1630 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:02:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-04 06:02:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 491. [2025-03-04 06:02:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.4017094017094016) internal successors, (656), 472 states have internal predecessors, (656), 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-03-04 06:02:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 686 transitions. [2025-03-04 06:02:00,580 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 686 transitions. Word has length 65 [2025-03-04 06:02:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 686 transitions. [2025-03-04 06:02:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-03-04 06:02:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 686 transitions. [2025-03-04 06:02:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:02:00,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:00,581 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] [2025-03-04 06:02:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:02:00,582 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-03-04 06:02:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 360295658, now seen corresponding path program 1 times [2025-03-04 06:02:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119740412] [2025-03-04 06:02:00,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:00,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:02:00,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:02:00,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119740412] [2025-03-04 06:02:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119740412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034272911] [2025-03-04 06:02:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:00,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:00,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:00,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:00,854 INFO L87 Difference]: Start difference. First operand 491 states and 686 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-03-04 06:02:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:01,359 INFO L93 Difference]: Finished difference Result 990 states and 1387 transitions. [2025-03-04 06:02:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 65 [2025-03-04 06:02:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:01,362 INFO L225 Difference]: With dead ends: 990 [2025-03-04 06:02:01,362 INFO L226 Difference]: Without dead ends: 503 [2025-03-04 06:02:01,363 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-03-04 06:02:01,365 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 14 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:01,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2992 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-04 06:02:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 500. [2025-03-04 06:02:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 477 states have (on average 1.4025157232704402) internal successors, (669), 481 states have internal predecessors, (669), 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-03-04 06:02:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 699 transitions. [2025-03-04 06:02:01,382 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 699 transitions. Word has length 65 [2025-03-04 06:02:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:01,382 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 699 transitions. [2025-03-04 06:02:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-03-04 06:02:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 699 transitions. [2025-03-04 06:02:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:02:01,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:01,383 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-03-04 06:02:01,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:02:01,383 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-03-04 06:02:01,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1037271626, now seen corresponding path program 1 times [2025-03-04 06:02:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299512872] [2025-03-04 06:02:01,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:01,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:02:01,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:02:01,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299512872] [2025-03-04 06:02:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299512872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:02:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176493661] [2025-03-04 06:02:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:01,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:02:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:01,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:02:01,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:02:01,575 INFO L87 Difference]: Start difference. First operand 500 states and 699 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-03-04 06:02:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:01,984 INFO L93 Difference]: Finished difference Result 999 states and 1399 transitions. [2025-03-04 06:02:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:02:01,984 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-03-04 06:02:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:01,986 INFO L225 Difference]: With dead ends: 999 [2025-03-04 06:02:01,987 INFO L226 Difference]: Without dead ends: 503 [2025-03-04 06:02:01,987 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-03-04 06:02:01,988 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 8 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:01,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2519 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:02:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-04 06:02:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-04 06:02:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 480 states have (on average 1.4) internal successors, (672), 484 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 702 transitions. [2025-03-04 06:02:01,999 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 702 transitions. Word has length 66 [2025-03-04 06:02:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:01,999 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 702 transitions. [2025-03-04 06:02:02,000 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-03-04 06:02:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 702 transitions. [2025-03-04 06:02:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:02:02,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:02,000 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-03-04 06:02:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:02:02,001 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-03-04 06:02:02,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:02,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1590226202, now seen corresponding path program 1 times [2025-03-04 06:02:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686187953] [2025-03-04 06:02:02,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:02:02,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:02:02,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:02,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686187953] [2025-03-04 06:02:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686187953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:02:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849735417] [2025-03-04 06:02:02,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:02,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:02:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:02,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:02:02,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:02,385 INFO L87 Difference]: Start difference. First operand 503 states and 702 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-03-04 06:02:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:03,103 INFO L93 Difference]: Finished difference Result 1018 states and 1425 transitions. [2025-03-04 06:02:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:02:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-03-04 06:02:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:03,105 INFO L225 Difference]: With dead ends: 1018 [2025-03-04 06:02:03,105 INFO L226 Difference]: Without dead ends: 519 [2025-03-04 06:02:03,106 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-03-04 06:02:03,107 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 33 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:03,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4062 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:02:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-04 06:02:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2025-03-04 06:02:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 490 states have (on average 1.4) internal successors, (686), 494 states have internal predecessors, (686), 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-03-04 06:02:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 716 transitions. [2025-03-04 06:02:03,118 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 716 transitions. Word has length 66 [2025-03-04 06:02:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:03,118 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 716 transitions. [2025-03-04 06:02:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-03-04 06:02:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 716 transitions. [2025-03-04 06:02:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:02:03,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:03,119 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-03-04 06:02:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:02:03,119 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-03-04 06:02:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1785205930, now seen corresponding path program 1 times [2025-03-04 06:02:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909512078] [2025-03-04 06:02:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:03,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:02:03,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:02:03,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:03,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909512078] [2025-03-04 06:02:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909512078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:02:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938822936] [2025-03-04 06:02:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:03,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:02:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:03,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:02:03,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:02:03,427 INFO L87 Difference]: Start difference. First operand 513 states and 716 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-03-04 06:02:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:03,974 INFO L93 Difference]: Finished difference Result 1028 states and 1437 transitions. [2025-03-04 06:02:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:02:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-03-04 06:02:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:03,977 INFO L225 Difference]: With dead ends: 1028 [2025-03-04 06:02:03,978 INFO L226 Difference]: Without dead ends: 519 [2025-03-04 06:02:03,979 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-03-04 06:02:03,979 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 27 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:03,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3089 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-04 06:02:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 516. [2025-03-04 06:02:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-03-04 06:02:03,994 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 66 [2025-03-04 06:02:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:03,994 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-03-04 06:02:03,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-03-04 06:02:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-03-04 06:02:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:02:03,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:03,995 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-03-04 06:02:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:02:03,996 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-03-04 06:02:03,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2053207665, now seen corresponding path program 1 times [2025-03-04 06:02:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57224602] [2025-03-04 06:02:03,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:02:04,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:02:04,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:04,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57224602] [2025-03-04 06:02:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57224602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:04,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268323374] [2025-03-04 06:02:04,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:04,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:04,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:04,185 INFO L87 Difference]: Start difference. First operand 516 states and 719 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-03-04 06:02:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:04,717 INFO L93 Difference]: Finished difference Result 1035 states and 1445 transitions. [2025-03-04 06:02:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:04,717 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-03-04 06:02:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:04,719 INFO L225 Difference]: With dead ends: 1035 [2025-03-04 06:02:04,719 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 06:02:04,720 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-03-04 06:02:04,721 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 12 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:04,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2998 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 06:02:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 516. [2025-03-04 06:02:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-03-04 06:02:04,731 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 67 [2025-03-04 06:02:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:04,731 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-03-04 06:02:04,731 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-03-04 06:02:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-03-04 06:02:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:02:04,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:04,732 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-03-04 06:02:04,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:02:04,732 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-03-04 06:02:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash -769544067, now seen corresponding path program 1 times [2025-03-04 06:02:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899852003] [2025-03-04 06:02:04,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:04,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:02:04,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:02:04,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:04,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899852003] [2025-03-04 06:02:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899852003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:02:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967369042] [2025-03-04 06:02:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:02:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:05,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:02:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:05,114 INFO L87 Difference]: Start difference. First operand 516 states and 719 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:02:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:06,950 INFO L93 Difference]: Finished difference Result 1518 states and 2129 transitions. [2025-03-04 06:02:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:02:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:02:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:06,954 INFO L225 Difference]: With dead ends: 1518 [2025-03-04 06:02:06,955 INFO L226 Difference]: Without dead ends: 1006 [2025-03-04 06:02:06,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:02:06,957 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 900 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:06,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 3833 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 06:02:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-04 06:02:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 546. [2025-03-04 06:02:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 523 states have (on average 1.384321223709369) internal successors, (724), 527 states have internal predecessors, (724), 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-03-04 06:02:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 754 transitions. [2025-03-04 06:02:06,988 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 754 transitions. Word has length 67 [2025-03-04 06:02:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:06,988 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 754 transitions. [2025-03-04 06:02:06,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:02:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 754 transitions. [2025-03-04 06:02:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:02:06,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:06,989 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-03-04 06:02:06,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:02:06,989 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-03-04 06:02:06,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1457073885, now seen corresponding path program 1 times [2025-03-04 06:02:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169057771] [2025-03-04 06:02:06,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:02:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:02:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169057771] [2025-03-04 06:02:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169057771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:02:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972386300] [2025-03-04 06:02:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:07,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:02:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:07,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:02:07,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:07,373 INFO L87 Difference]: Start difference. First operand 546 states and 754 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-03-04 06:02:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:08,458 INFO L93 Difference]: Finished difference Result 1071 states and 1487 transitions. [2025-03-04 06:02:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:02:08,461 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-03-04 06:02:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:08,463 INFO L225 Difference]: With dead ends: 1071 [2025-03-04 06:02:08,463 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 06:02:08,468 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-03-04 06:02:08,470 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 20 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:08,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3583 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:02:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 06:02:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 549. [2025-03-04 06:02:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 526 states have (on average 1.3840304182509506) internal successors, (728), 530 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 758 transitions. [2025-03-04 06:02:08,528 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 758 transitions. Word has length 68 [2025-03-04 06:02:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 758 transitions. [2025-03-04 06:02:08,529 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-03-04 06:02:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 758 transitions. [2025-03-04 06:02:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:02:08,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:08,533 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-03-04 06:02:08,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:02:08,533 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-03-04 06:02:08,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -213932779, now seen corresponding path program 1 times [2025-03-04 06:02:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:08,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699167933] [2025-03-04 06:02:08,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:02:08,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:02:08,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:08,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-03-04 06:02:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:08,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699167933] [2025-03-04 06:02:08,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699167933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:08,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:02:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722163330] [2025-03-04 06:02:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:02:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:08,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:02:08,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:08,918 INFO L87 Difference]: Start difference. First operand 549 states and 758 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-03-04 06:02:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:10,209 INFO L93 Difference]: Finished difference Result 1092 states and 1516 transitions. [2025-03-04 06:02:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:10,209 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-03-04 06:02:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:10,212 INFO L225 Difference]: With dead ends: 1092 [2025-03-04 06:02:10,212 INFO L226 Difference]: Without dead ends: 577 [2025-03-04 06:02:10,213 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-03-04 06:02:10,214 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 37 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:10,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3994 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 06:02:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-04 06:02:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 549. [2025-03-04 06:02:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 526 states have (on average 1.3840304182509506) internal successors, (728), 530 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 758 transitions. [2025-03-04 06:02:10,231 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 758 transitions. Word has length 68 [2025-03-04 06:02:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:10,231 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 758 transitions. [2025-03-04 06:02:10,231 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-03-04 06:02:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 758 transitions. [2025-03-04 06:02:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:02:10,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:10,232 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-03-04 06:02:10,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:02:10,233 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-03-04 06:02:10,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1017688498, now seen corresponding path program 1 times [2025-03-04 06:02:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280225690] [2025-03-04 06:02:10,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:10,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:02:10,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:02:10,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:10,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280225690] [2025-03-04 06:02:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280225690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416104160] [2025-03-04 06:02:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:10,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:10,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:10,569 INFO L87 Difference]: Start difference. First operand 549 states and 758 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:11,574 INFO L93 Difference]: Finished difference Result 1080 states and 1500 transitions. [2025-03-04 06:02:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:11,577 INFO L225 Difference]: With dead ends: 1080 [2025-03-04 06:02:11,578 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 06:02:11,580 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-03-04 06:02:11,581 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 23 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4499 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:11,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4499 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 06:02:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 06:02:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2025-03-04 06:02:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 536 states have (on average 1.3805970149253732) internal successors, (740), 540 states have internal predecessors, (740), 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-03-04 06:02:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 770 transitions. [2025-03-04 06:02:11,599 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 770 transitions. Word has length 69 [2025-03-04 06:02:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:11,599 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 770 transitions. [2025-03-04 06:02:11,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 770 transitions. [2025-03-04 06:02:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:02:11,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:11,601 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-03-04 06:02:11,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:02:11,601 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-03-04 06:02:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1279287530, now seen corresponding path program 1 times [2025-03-04 06:02:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-03-04 06:02:11,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:11,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:02:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:02:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-03-04 06:02:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736330772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137709763] [2025-03-04 06:02:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:11,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:11,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:11,941 INFO L87 Difference]: Start difference. First operand 559 states and 770 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:13,247 INFO L93 Difference]: Finished difference Result 1102 states and 1527 transitions. [2025-03-04 06:02:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:13,250 INFO L225 Difference]: With dead ends: 1102 [2025-03-04 06:02:13,254 INFO L226 Difference]: Without dead ends: 577 [2025-03-04 06:02:13,256 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-03-04 06:02:13,256 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 17 mSDsluCounter, 3892 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:13,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4476 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 06:02:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-04 06:02:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 562. [2025-03-04 06:02:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3803339517625233) internal successors, (744), 543 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 774 transitions. [2025-03-04 06:02:13,289 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 774 transitions. Word has length 69 [2025-03-04 06:02:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:13,289 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 774 transitions. [2025-03-04 06:02:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-03-04 06:02:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 774 transitions. [2025-03-04 06:02:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:02:13,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:13,291 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-03-04 06:02:13,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:02:13,291 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-03-04 06:02:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash 100116598, now seen corresponding path program 1 times [2025-03-04 06:02:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584695616] [2025-03-04 06:02:13,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:13,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:02:13,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:02:13,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:13,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584695616] [2025-03-04 06:02:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584695616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:13,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001368178] [2025-03-04 06:02:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:13,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:13,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:13,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:13,785 INFO L87 Difference]: Start difference. First operand 562 states and 774 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-03-04 06:02:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:14,352 INFO L93 Difference]: Finished difference Result 1097 states and 1517 transitions. [2025-03-04 06:02:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:14,353 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-03-04 06:02:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:14,356 INFO L225 Difference]: With dead ends: 1097 [2025-03-04 06:02:14,356 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 06:02:14,358 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-03-04 06:02:14,358 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 11 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:14,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3029 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 06:02:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 562. [2025-03-04 06:02:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3784786641929498) internal successors, (743), 543 states have internal predecessors, (743), 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-03-04 06:02:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 773 transitions. [2025-03-04 06:02:14,390 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 773 transitions. Word has length 69 [2025-03-04 06:02:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 773 transitions. [2025-03-04 06:02:14,391 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-03-04 06:02:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 773 transitions. [2025-03-04 06:02:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:02:14,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:14,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:02:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:02:14,396 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-03-04 06:02:14,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1019651762, now seen corresponding path program 1 times [2025-03-04 06:02:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360670724] [2025-03-04 06:02:14,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:14,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:02:14,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:02:14,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:14,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:14,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360670724] [2025-03-04 06:02:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360670724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610601918] [2025-03-04 06:02:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:14,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:14,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:14,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:14,809 INFO L87 Difference]: Start difference. First operand 562 states and 773 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-03-04 06:02:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:15,743 INFO L93 Difference]: Finished difference Result 1095 states and 1515 transitions. [2025-03-04 06:02:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:15,744 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-03-04 06:02:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:15,747 INFO L225 Difference]: With dead ends: 1095 [2025-03-04 06:02:15,750 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 06:02:15,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:15,752 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 8 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:15,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2965 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 06:02:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 06:02:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2025-03-04 06:02:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 543 states have (on average 1.3775322283609577) internal successors, (748), 547 states have internal predecessors, (748), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:02:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 778 transitions. [2025-03-04 06:02:15,781 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 778 transitions. Word has length 69 [2025-03-04 06:02:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:15,782 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 778 transitions. [2025-03-04 06:02:15,782 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-03-04 06:02:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 778 transitions. [2025-03-04 06:02:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:02:15,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:15,785 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-03-04 06:02:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:02:15,785 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-03-04 06:02:15,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 395106455, now seen corresponding path program 1 times [2025-03-04 06:02:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293134773] [2025-03-04 06:02:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:15,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:02:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:02:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:16,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293134773] [2025-03-04 06:02:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293134773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613709954] [2025-03-04 06:02:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:16,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:16,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:16,530 INFO L87 Difference]: Start difference. First operand 566 states and 778 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:21,383 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-03-04 06:02:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:21,908 INFO L93 Difference]: Finished difference Result 1110 states and 1535 transitions. [2025-03-04 06:02:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:21,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:21,916 INFO L225 Difference]: With dead ends: 1110 [2025-03-04 06:02:21,917 INFO L226 Difference]: Without dead ends: 578 [2025-03-04 06:02:21,918 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-03-04 06:02:21,918 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 13 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:21,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3982 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1352 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 06:02:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-04 06:02:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2025-03-04 06:02:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 547 states have (on average 1.376599634369287) internal successors, (753), 551 states have internal predecessors, (753), 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-03-04 06:02:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 783 transitions. [2025-03-04 06:02:21,968 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 783 transitions. Word has length 70 [2025-03-04 06:02:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:21,968 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 783 transitions. [2025-03-04 06:02:21,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 783 transitions. [2025-03-04 06:02:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:02:21,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:21,985 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-03-04 06:02:21,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:02:21,985 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-03-04 06:02:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1008537532, now seen corresponding path program 1 times [2025-03-04 06:02:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166426362] [2025-03-04 06:02:21,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:22,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:02:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:02:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166426362] [2025-03-04 06:02:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166426362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:02:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306277412] [2025-03-04 06:02:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:02:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:22,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:02:22,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:02:22,405 INFO L87 Difference]: Start difference. First operand 570 states and 783 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-04 06:02:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:23,470 INFO L93 Difference]: Finished difference Result 1120 states and 1546 transitions. [2025-03-04 06:02:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:23,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-04 06:02:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:23,473 INFO L225 Difference]: With dead ends: 1120 [2025-03-04 06:02:23,473 INFO L226 Difference]: Without dead ends: 584 [2025-03-04 06:02:23,474 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-03-04 06:02:23,474 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 40 mSDsluCounter, 3942 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:23,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4533 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:02:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-04 06:02:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 573. [2025-03-04 06:02:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 550 states have (on average 1.3745454545454545) internal successors, (756), 554 states have internal predecessors, (756), 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-03-04 06:02:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 786 transitions. [2025-03-04 06:02:23,487 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 786 transitions. Word has length 70 [2025-03-04 06:02:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:23,487 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 786 transitions. [2025-03-04 06:02:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-04 06:02:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 786 transitions. [2025-03-04 06:02:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:02:23,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:23,488 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-03-04 06:02:23,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:02:23,488 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-03-04 06:02:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 875471055, now seen corresponding path program 1 times [2025-03-04 06:02:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176887178] [2025-03-04 06:02:23,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:23,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:02:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:02:23,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:24,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-03-04 06:02:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176887178] [2025-03-04 06:02:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176887178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:24,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290907054] [2025-03-04 06:02:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:24,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:24,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:24,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:24,016 INFO L87 Difference]: Start difference. First operand 573 states and 786 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:26,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:02:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:27,363 INFO L93 Difference]: Finished difference Result 1135 states and 1564 transitions. [2025-03-04 06:02:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:27,367 INFO L225 Difference]: With dead ends: 1135 [2025-03-04 06:02:27,367 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 06:02:27,369 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-03-04 06:02:27,372 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 44 mSDsluCounter, 3825 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4420 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:27,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4420 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 06:02:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 06:02:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 574. [2025-03-04 06:02:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 551 states have (on average 1.3738656987295825) internal successors, (757), 555 states have internal predecessors, (757), 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-03-04 06:02:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 787 transitions. [2025-03-04 06:02:27,390 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 787 transitions. Word has length 70 [2025-03-04 06:02:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:27,391 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 787 transitions. [2025-03-04 06:02:27,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 06:02:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 787 transitions. [2025-03-04 06:02:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:02:27,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:27,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:02:27,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:02:27,392 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-03-04 06:02:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 555428946, now seen corresponding path program 1 times [2025-03-04 06:02:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609161458] [2025-03-04 06:02:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:02:27,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:02:27,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609161458] [2025-03-04 06:02:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609161458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:02:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482788622] [2025-03-04 06:02:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:02:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:02:27,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:27,606 INFO L87 Difference]: Start difference. First operand 574 states and 787 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-03-04 06:02:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:28,373 INFO L93 Difference]: Finished difference Result 1140 states and 1571 transitions. [2025-03-04 06:02:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:28,374 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-03-04 06:02:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:28,376 INFO L225 Difference]: With dead ends: 1140 [2025-03-04 06:02:28,376 INFO L226 Difference]: Without dead ends: 600 [2025-03-04 06:02:28,377 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-03-04 06:02:28,379 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 33 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:28,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3994 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:02:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-04 06:02:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 571. [2025-03-04 06:02:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 548 states have (on average 1.3759124087591241) internal successors, (754), 552 states have internal predecessors, (754), 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-03-04 06:02:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 784 transitions. [2025-03-04 06:02:28,393 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 784 transitions. Word has length 70 [2025-03-04 06:02:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:28,395 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 784 transitions. [2025-03-04 06:02:28,395 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-03-04 06:02:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 784 transitions. [2025-03-04 06:02:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:02:28,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:28,395 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-03-04 06:02:28,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:02:28,396 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-03-04 06:02:28,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 281698465, now seen corresponding path program 1 times [2025-03-04 06:02:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442568743] [2025-03-04 06:02:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:02:28,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:02:28,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:28,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:03:10,027 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 06:03:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:03:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:03:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442568743] [2025-03-04 06:03:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442568743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:03:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:03:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:03:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468188144] [2025-03-04 06:03:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:03:22,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:03:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:03:22,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:03:22,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2025-03-04 06:03:22,084 INFO L87 Difference]: Start difference. First operand 571 states and 784 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-04 06:03:29,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []