./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.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_FNV_test6-1.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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:05:06,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:05:06,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:05:06,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:05:06,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:05:06,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:05:06,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:05:06,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:05:06,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:05:06,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:05:06,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:05:06,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:05:06,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:05:06,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:05:06,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:05:06,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:05:06,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:05:06,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:05:06,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:06,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:05:06,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:05:06,470 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2025-03-04 06:05:06,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:05:06,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:05:06,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:05:06,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:05:06,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:05:06,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-04 06:05:07,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ca9ca05/8b06cf4b9e054f2db4bc162262e947e5/FLAG8497dccc5 [2025-03-04 06:05:08,385 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:05:08,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-04 06:05:08,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ca9ca05/8b06cf4b9e054f2db4bc162262e947e5/FLAG8497dccc5 [2025-03-04 06:05:08,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ca9ca05/8b06cf4b9e054f2db4bc162262e947e5 [2025-03-04 06:05:08,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:05:08,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:05:08,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:08,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:05:08,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:05:08,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:08" (1/1) ... [2025-03-04 06:05:08,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7348bbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:08, skipping insertion in model container [2025-03-04 06:05:08,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:08" (1/1) ... [2025-03-04 06:05:08,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:05:08,786 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_FNV_test6-1.i[44118,44131] [2025-03-04 06:05:08,801 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_FNV_test6-1.i[44660,44673] [2025-03-04 06:05:08,875 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_FNV_test6-1.i[56247,56260] [2025-03-04 06:05:08,875 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_FNV_test6-1.i[56368,56381] [2025-03-04 06:05:08,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:08,900 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:05:08,946 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_FNV_test6-1.i[44118,44131] [2025-03-04 06:05:08,948 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_FNV_test6-1.i[44660,44673] [2025-03-04 06:05:09,003 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_FNV_test6-1.i[56247,56260] [2025-03-04 06:05:09,005 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_FNV_test6-1.i[56368,56381] [2025-03-04 06:05:09,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:09,050 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:05:09,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09 WrapperNode [2025-03-04 06:05:09,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:09,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:09,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:05:09,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:05:09,056 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:05:09" (1/1) ... [2025-03-04 06:05:09,081 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:05:09" (1/1) ... [2025-03-04 06:05:09,131 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-03-04 06:05:09,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:09,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:05:09,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:05:09,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:05:09,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,219 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2025-03-04 06:05:09,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:05:09,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:05:09,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:05:09,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:05:09,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (1/1) ... [2025-03-04 06:05:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:09,333 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:05:09,339 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:05:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-04 06:05:09,360 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:05:09,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-04 06:05:09,360 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:05:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-04 06:05:09,361 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 06:05:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:05:09,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:05:09,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:05:09,543 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:05:09,586 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-04 06:05:10,568 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-04 06:05:10,569 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:05:10,569 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:05:10,631 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-03-04 06:05:10,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:05:10,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:05:10,702 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:05:10,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:10 BoogieIcfgContainer [2025-03-04 06:05:10,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:05:10,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:05:10,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:05:10,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:05:10,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:05:08" (1/3) ... [2025-03-04 06:05:10,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a8467b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:10, skipping insertion in model container [2025-03-04 06:05:10,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:09" (2/3) ... [2025-03-04 06:05:10,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a8467b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:10, skipping insertion in model container [2025-03-04 06:05:10,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:10" (3/3) ... [2025-03-04 06:05:10,711 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2025-03-04 06:05:10,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:05:10,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test6-1.i that has 5 procedures, 429 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-04 06:05:10,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:05:10,790 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;@4ef950d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:05:10,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 06:05:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 06:05:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 06:05:10,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:10,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:10,802 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:05:10,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1073890916, now seen corresponding path program 1 times [2025-03-04 06:05:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871981266] [2025-03-04 06:05:10,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 06:05:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 06:05:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:10,956 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:05:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871981266] [2025-03-04 06:05:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871981266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:10,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:05:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87659883] [2025-03-04 06:05:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:10,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:05:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:10,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:05:10,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:05:10,987 INFO L87 Difference]: Start difference. First operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:11,086 INFO L93 Difference]: Finished difference Result 854 states and 1359 transitions. [2025-03-04 06:05:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:05:11,090 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:05:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:11,099 INFO L225 Difference]: With dead ends: 854 [2025-03-04 06:05:11,099 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 06:05:11,103 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:05:11,105 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:11,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 06:05:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-04 06:05:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 402 states have (on average 1.4402985074626866) internal successors, (579), 407 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 604 transitions. [2025-03-04 06:05:11,153 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 604 transitions. Word has length 8 [2025-03-04 06:05:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:11,154 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 604 transitions. [2025-03-04 06:05:11,154 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:05:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 604 transitions. [2025-03-04 06:05:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 06:05:11,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:11,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:11,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:05:11,154 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:05:11,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2034121717, now seen corresponding path program 1 times [2025-03-04 06:05:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037243426] [2025-03-04 06:05:11,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 06:05:11,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 06:05:11,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:11,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:11,340 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:05:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037243426] [2025-03-04 06:05:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037243426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:11,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:11,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324298915] [2025-03-04 06:05:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:11,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:11,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:11,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:11,343 INFO L87 Difference]: Start difference. First operand 423 states and 604 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:05:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:11,653 INFO L93 Difference]: Finished difference Result 1029 states and 1480 transitions. [2025-03-04 06:05:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:11,654 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:05:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:11,660 INFO L225 Difference]: With dead ends: 1029 [2025-03-04 06:05:11,661 INFO L226 Difference]: Without dead ends: 819 [2025-03-04 06:05:11,662 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:05:11,665 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 552 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:11,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1611 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:05:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-04 06:05:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 425. [2025-03-04 06:05:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.438118811881188) internal successors, (581), 409 states have internal predecessors, (581), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 606 transitions. [2025-03-04 06:05:11,684 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 606 transitions. Word has length 10 [2025-03-04 06:05:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 606 transitions. [2025-03-04 06:05:11,685 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:05:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 606 transitions. [2025-03-04 06:05:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:05:11,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:11,686 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:05:11,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:05:11,687 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:05:11,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -577258923, now seen corresponding path program 1 times [2025-03-04 06:05:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037745895] [2025-03-04 06:05:11,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:11,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:05:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:05:11,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:11,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:11,940 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:05:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037745895] [2025-03-04 06:05:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037745895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012115018] [2025-03-04 06:05:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:11,941 INFO L87 Difference]: Start difference. First operand 425 states and 606 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:05:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:12,078 INFO L93 Difference]: Finished difference Result 849 states and 1211 transitions. [2025-03-04 06:05:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:12,078 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:05:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:12,080 INFO L225 Difference]: With dead ends: 849 [2025-03-04 06:05:12,081 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 06:05:12,082 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:05:12,082 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 105 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:12,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1521 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 06:05:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-03-04 06:05:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 409 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2025-03-04 06:05:12,095 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 64 [2025-03-04 06:05:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:12,095 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2025-03-04 06:05:12,095 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:05:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2025-03-04 06:05:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:05:12,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:12,096 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:05:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:05:12,096 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:05:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1694587505, now seen corresponding path program 1 times [2025-03-04 06:05:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526910294] [2025-03-04 06:05:12,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:12,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:05:12,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:05:12,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:12,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:12,564 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:05:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526910294] [2025-03-04 06:05:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526910294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:12,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:05:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208487875] [2025-03-04 06:05:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:05:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:12,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:05:12,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:05:12,567 INFO L87 Difference]: Start difference. First operand 425 states and 599 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:05:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:13,148 INFO L93 Difference]: Finished difference Result 880 states and 1239 transitions. [2025-03-04 06:05:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:05:13,149 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:05:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:13,151 INFO L225 Difference]: With dead ends: 880 [2025-03-04 06:05:13,152 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 06:05:13,152 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:05:13,153 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 14 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:13,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2230 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:05:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 06:05:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 452. [2025-03-04 06:05:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.408352668213457) internal successors, (607), 436 states have internal predecessors, (607), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 632 transitions. [2025-03-04 06:05:13,164 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 632 transitions. Word has length 64 [2025-03-04 06:05:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:13,165 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 632 transitions. [2025-03-04 06:05:13,165 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:05:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 632 transitions. [2025-03-04 06:05:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:05:13,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:13,166 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:05:13,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:05:13,166 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:05:13,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash -245950012, now seen corresponding path program 1 times [2025-03-04 06:05:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656456004] [2025-03-04 06:05:13,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:13,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:13,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:05:13,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:05:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:13,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:13,499 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:05:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656456004] [2025-03-04 06:05:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656456004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:13,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516754315] [2025-03-04 06:05:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:13,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:13,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:13,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:13,505 INFO L87 Difference]: Start difference. First operand 452 states and 632 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:05:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:13,773 INFO L93 Difference]: Finished difference Result 909 states and 1274 transitions. [2025-03-04 06:05:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:13,773 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:05:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:13,776 INFO L225 Difference]: With dead ends: 909 [2025-03-04 06:05:13,776 INFO L226 Difference]: Without dead ends: 461 [2025-03-04 06:05:13,777 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:05:13,777 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 17 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1474 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:05:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-04 06:05:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 453. [2025-03-04 06:05:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.4074074074074074) internal successors, (608), 437 states have internal predecessors, (608), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 633 transitions. [2025-03-04 06:05:13,797 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 633 transitions. Word has length 65 [2025-03-04 06:05:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:13,797 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 633 transitions. [2025-03-04 06:05:13,797 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:05:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 633 transitions. [2025-03-04 06:05:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:05:13,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:13,799 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:05:13,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:05:13,800 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:05:13,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 920060683, now seen corresponding path program 1 times [2025-03-04 06:05:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277965251] [2025-03-04 06:05:13,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:13,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:05:13,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:05:13,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:14,053 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:05:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:14,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277965251] [2025-03-04 06:05:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277965251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593612271] [2025-03-04 06:05:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:14,055 INFO L87 Difference]: Start difference. First operand 453 states and 633 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:05:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:14,581 INFO L93 Difference]: Finished difference Result 914 states and 1281 transitions. [2025-03-04 06:05:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:14,581 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:05:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:14,584 INFO L225 Difference]: With dead ends: 914 [2025-03-04 06:05:14,584 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 06:05:14,587 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:05:14,588 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 14 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:14,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2680 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:05:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 06:05:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2025-03-04 06:05:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.4081632653061225) internal successors, (621), 446 states have internal predecessors, (621), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 646 transitions. [2025-03-04 06:05:14,609 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 646 transitions. Word has length 65 [2025-03-04 06:05:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 646 transitions. [2025-03-04 06:05:14,609 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:05:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 646 transitions. [2025-03-04 06:05:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:05:14,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:14,610 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:05:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:05:14,610 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:05:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1788179634, now seen corresponding path program 1 times [2025-03-04 06:05:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380248363] [2025-03-04 06:05:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:14,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:05:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:05:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:14,837 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:05:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:14,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380248363] [2025-03-04 06:05:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380248363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:05:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573537530] [2025-03-04 06:05:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:14,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:05:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:14,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:05:14,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:05:14,839 INFO L87 Difference]: Start difference. First operand 462 states and 646 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:05:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:15,277 INFO L93 Difference]: Finished difference Result 923 states and 1293 transitions. [2025-03-04 06:05:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:05:15,278 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:05:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:15,280 INFO L225 Difference]: With dead ends: 923 [2025-03-04 06:05:15,281 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 06:05:15,283 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:05:15,284 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 8 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:15,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2259 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:05:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 06:05:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 06:05:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 444 states have (on average 1.4054054054054055) internal successors, (624), 449 states have internal predecessors, (624), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 649 transitions. [2025-03-04 06:05:15,303 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 649 transitions. Word has length 66 [2025-03-04 06:05:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:15,303 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 649 transitions. [2025-03-04 06:05:15,304 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:05:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 649 transitions. [2025-03-04 06:05:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:05:15,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:15,305 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:05:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:05:15,305 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:05:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 120710166, now seen corresponding path program 1 times [2025-03-04 06:05:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587952547] [2025-03-04 06:05:15,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:05:15,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:05:15,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:15,663 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:05:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587952547] [2025-03-04 06:05:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587952547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:15,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:05:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131597204] [2025-03-04 06:05:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:15,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:05:15,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:15,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:05:15,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:05:15,667 INFO L87 Difference]: Start difference. First operand 465 states and 649 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:05:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:16,440 INFO L93 Difference]: Finished difference Result 942 states and 1319 transitions. [2025-03-04 06:05:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:05:16,441 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:05:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:16,443 INFO L225 Difference]: With dead ends: 942 [2025-03-04 06:05:16,443 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 06:05:16,444 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:05:16,445 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 33 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:16,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3646 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:05:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 06:05:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2025-03-04 06:05:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 454 states have (on average 1.4052863436123348) internal successors, (638), 459 states have internal predecessors, (638), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2025-03-04 06:05:16,457 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 66 [2025-03-04 06:05:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:16,457 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2025-03-04 06:05:16,457 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:05:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2025-03-04 06:05:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:05:16,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:16,458 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:05:16,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:05:16,458 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:05:16,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:16,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1040245330, now seen corresponding path program 1 times [2025-03-04 06:05:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392507893] [2025-03-04 06:05:16,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:16,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:05:16,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:05:16,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:16,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:16,814 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:05:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:16,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392507893] [2025-03-04 06:05:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392507893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:05:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517155447] [2025-03-04 06:05:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:16,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:05:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:16,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:05:16,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:05:16,816 INFO L87 Difference]: Start difference. First operand 475 states and 663 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:05:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:17,467 INFO L93 Difference]: Finished difference Result 952 states and 1331 transitions. [2025-03-04 06:05:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:05:17,468 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:05:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:17,470 INFO L225 Difference]: With dead ends: 952 [2025-03-04 06:05:17,470 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 06:05:17,471 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:05:17,471 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 27 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:17,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3199 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:05:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 06:05:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2025-03-04 06:05:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-04 06:05:17,490 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 66 [2025-03-04 06:05:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-04 06:05:17,490 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:05:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-04 06:05:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:05:17,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:17,492 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:05:17,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:05:17,493 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:05:17,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash 885840396, now seen corresponding path program 1 times [2025-03-04 06:05:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258280314] [2025-03-04 06:05:17,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:05:17,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:05:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:17,737 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:05:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258280314] [2025-03-04 06:05:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258280314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355745279] [2025-03-04 06:05:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:17,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:17,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:17,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:17,739 INFO L87 Difference]: Start difference. First operand 478 states and 666 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:05:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:18,270 INFO L93 Difference]: Finished difference Result 959 states and 1339 transitions. [2025-03-04 06:05:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:18,270 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:05:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:18,273 INFO L225 Difference]: With dead ends: 959 [2025-03-04 06:05:18,273 INFO L226 Difference]: Without dead ends: 485 [2025-03-04 06:05:18,274 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:05:18,274 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 12 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:18,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2686 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:05:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-04 06:05:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2025-03-04 06:05:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-04 06:05:18,286 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 67 [2025-03-04 06:05:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-04 06:05:18,286 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:05:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-04 06:05:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:05:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:18,287 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:05:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:05:18,287 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:05:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash 800296954, now seen corresponding path program 1 times [2025-03-04 06:05:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392069603] [2025-03-04 06:05:18,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:18,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:05:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:05:18,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:18,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:18,816 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:05:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392069603] [2025-03-04 06:05:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392069603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:05:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636399862] [2025-03-04 06:05:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:18,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:05:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:18,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:05:18,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:05:18,818 INFO L87 Difference]: Start difference. First operand 478 states and 666 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:05:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:20,037 INFO L93 Difference]: Finished difference Result 1404 states and 1970 transitions. [2025-03-04 06:05:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:05:20,037 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:05:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:20,041 INFO L225 Difference]: With dead ends: 1404 [2025-03-04 06:05:20,042 INFO L226 Difference]: Without dead ends: 930 [2025-03-04 06:05:20,043 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:05:20,043 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 852 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:20,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3661 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 06:05:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-04 06:05:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 508. [2025-03-04 06:05:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 487 states have (on average 1.3880903490759753) internal successors, (676), 492 states have internal predecessors, (676), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 701 transitions. [2025-03-04 06:05:20,060 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 701 transitions. Word has length 67 [2025-03-04 06:05:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:20,060 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 701 transitions. [2025-03-04 06:05:20,060 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:05:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 701 transitions. [2025-03-04 06:05:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:05:20,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:20,061 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:05:20,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:05:20,061 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:05:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1280407161, now seen corresponding path program 1 times [2025-03-04 06:05:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200043600] [2025-03-04 06:05:20,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:20,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:05:20,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:05:20,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:20,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:20,294 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:05:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200043600] [2025-03-04 06:05:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200043600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:05:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667389368] [2025-03-04 06:05:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:05:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:20,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:05:20,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:05:20,297 INFO L87 Difference]: Start difference. First operand 508 states and 701 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:05:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:20,911 INFO L93 Difference]: Finished difference Result 995 states and 1381 transitions. [2025-03-04 06:05:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:05:20,912 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:05:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:20,915 INFO L225 Difference]: With dead ends: 995 [2025-03-04 06:05:20,915 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 06:05:20,917 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:05:20,917 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:20,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3648 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:05:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 06:05:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2025-03-04 06:05:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-04 06:05:20,936 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-04 06:05:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-04 06:05:20,937 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:05:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-04 06:05:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:05:20,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:20,939 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:05:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:05:20,939 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:05:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -940118731, now seen corresponding path program 1 times [2025-03-04 06:05:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930143353] [2025-03-04 06:05:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:20,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:05:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:05:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:21,185 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:05:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:21,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930143353] [2025-03-04 06:05:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930143353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:21,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:21,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:05:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718160616] [2025-03-04 06:05:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:05:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:21,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:05:21,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:05:21,186 INFO L87 Difference]: Start difference. First operand 511 states and 705 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:21,905 INFO L93 Difference]: Finished difference Result 1016 states and 1410 transitions. [2025-03-04 06:05:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:21,906 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:05:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:21,909 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 06:05:21,909 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 06:05:21,910 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:05:21,910 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:21,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3578 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:05:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 06:05:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 511. [2025-03-04 06:05:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-04 06:05:21,925 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-04 06:05:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:21,925 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-04 06:05:21,925 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:05:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-04 06:05:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:05:21,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:21,926 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:05:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:05:21,926 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:05:21,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 453215023, now seen corresponding path program 1 times [2025-03-04 06:05:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190956431] [2025-03-04 06:05:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:21,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:05:21,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:05:21,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:21,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:22,181 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:05:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190956431] [2025-03-04 06:05:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190956431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384681751] [2025-03-04 06:05:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:22,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:22,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:22,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:22,184 INFO L87 Difference]: Start difference. First operand 511 states and 705 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:05:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:22,874 INFO L93 Difference]: Finished difference Result 1004 states and 1394 transitions. [2025-03-04 06:05:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:22,874 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:05:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:22,876 INFO L225 Difference]: With dead ends: 1004 [2025-03-04 06:05:22,877 INFO L226 Difference]: Without dead ends: 527 [2025-03-04 06:05:22,877 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:05:22,878 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 23 mSDsluCounter, 3086 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:22,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3630 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:05:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-04 06:05:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 521. [2025-03-04 06:05:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 500 states have (on average 1.384) internal successors, (692), 505 states have internal predecessors, (692), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 717 transitions. [2025-03-04 06:05:22,892 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 717 transitions. Word has length 69 [2025-03-04 06:05:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:22,892 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 717 transitions. [2025-03-04 06:05:22,892 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:05:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 717 transitions. [2025-03-04 06:05:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:05:22,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:22,893 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:05:22,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:05:22,894 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:05:22,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash 336389107, now seen corresponding path program 1 times [2025-03-04 06:05:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:22,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176824069] [2025-03-04 06:05:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:22,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:05:22,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:05:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:23,123 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:05:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176824069] [2025-03-04 06:05:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176824069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228209557] [2025-03-04 06:05:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:23,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:23,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:23,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:23,126 INFO L87 Difference]: Start difference. First operand 521 states and 717 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:05:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:23,860 INFO L93 Difference]: Finished difference Result 1026 states and 1421 transitions. [2025-03-04 06:05:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:23,860 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:05:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:23,862 INFO L225 Difference]: With dead ends: 1026 [2025-03-04 06:05:23,862 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 06:05:23,863 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:05:23,864 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:23,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4008 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:05:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 06:05:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2025-03-04 06:05:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3836978131212723) internal successors, (696), 508 states have internal predecessors, (696), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 721 transitions. [2025-03-04 06:05:23,875 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 721 transitions. Word has length 69 [2025-03-04 06:05:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:23,876 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 721 transitions. [2025-03-04 06:05:23,876 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:05:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 721 transitions. [2025-03-04 06:05:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:05:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:23,876 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:05:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:05:23,877 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:05:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1715793235, now seen corresponding path program 1 times [2025-03-04 06:05:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432557001] [2025-03-04 06:05:23,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:23,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:05:23,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:05:23,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:23,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:24,067 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:05:24,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:24,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432557001] [2025-03-04 06:05:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432557001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146430479] [2025-03-04 06:05:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:24,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:24,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:24,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:24,070 INFO L87 Difference]: Start difference. First operand 524 states and 721 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:05:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:24,471 INFO L93 Difference]: Finished difference Result 1021 states and 1411 transitions. [2025-03-04 06:05:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:24,472 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:05:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:24,474 INFO L225 Difference]: With dead ends: 1021 [2025-03-04 06:05:24,474 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 06:05:24,475 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:05:24,477 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 11 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:24,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2717 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:05:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 06:05:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2025-03-04 06:05:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3817097415506958) internal successors, (695), 508 states have internal predecessors, (695), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 720 transitions. [2025-03-04 06:05:24,491 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 720 transitions. Word has length 69 [2025-03-04 06:05:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:24,491 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 720 transitions. [2025-03-04 06:05:24,491 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:05:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 720 transitions. [2025-03-04 06:05:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:05:24,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:24,492 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:05:24,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:05:24,492 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:05:24,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1659638897, now seen corresponding path program 1 times [2025-03-04 06:05:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384509573] [2025-03-04 06:05:24,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:24,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:05:24,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:05:24,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:24,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:24,655 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:05:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384509573] [2025-03-04 06:05:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384509573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:24,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838835364] [2025-03-04 06:05:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:24,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:24,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:24,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:24,658 INFO L87 Difference]: Start difference. First operand 524 states and 720 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:05:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:25,103 INFO L93 Difference]: Finished difference Result 1019 states and 1409 transitions. [2025-03-04 06:05:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:25,104 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:05:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:25,106 INFO L225 Difference]: With dead ends: 1019 [2025-03-04 06:05:25,106 INFO L226 Difference]: Without dead ends: 529 [2025-03-04 06:05:25,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:25,107 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 8 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:25,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2653 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:05:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-04 06:05:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2025-03-04 06:05:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 507 states have (on average 1.3806706114398422) internal successors, (700), 512 states have internal predecessors, (700), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 725 transitions. [2025-03-04 06:05:25,119 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 725 transitions. Word has length 69 [2025-03-04 06:05:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:25,120 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 725 transitions. [2025-03-04 06:05:25,120 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:05:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 725 transitions. [2025-03-04 06:05:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:05:25,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:25,121 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:05:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:05:25,121 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:05:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1849591247, now seen corresponding path program 1 times [2025-03-04 06:05:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022306489] [2025-03-04 06:05:25,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:25,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:05:25,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:05:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:25,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:25,399 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:05:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022306489] [2025-03-04 06:05:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022306489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:25,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:25,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:25,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343709346] [2025-03-04 06:05:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:25,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:25,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:25,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:25,402 INFO L87 Difference]: Start difference. First operand 528 states and 725 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:05:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:26,029 INFO L93 Difference]: Finished difference Result 1034 states and 1429 transitions. [2025-03-04 06:05:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:26,030 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:05:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:26,039 INFO L225 Difference]: With dead ends: 1034 [2025-03-04 06:05:26,039 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 06:05:26,040 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:05:26,040 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 13 mSDsluCounter, 3025 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:26,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3566 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:05:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 06:05:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-03-04 06:05:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 511 states have (on average 1.3796477495107633) internal successors, (705), 516 states have internal predecessors, (705), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 730 transitions. [2025-03-04 06:05:26,052 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 730 transitions. Word has length 70 [2025-03-04 06:05:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:26,052 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 730 transitions. [2025-03-04 06:05:26,053 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:05:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 730 transitions. [2025-03-04 06:05:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:05:26,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:26,054 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:05:26,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:05:26,054 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:05:26,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:26,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1772012149, now seen corresponding path program 1 times [2025-03-04 06:05:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:26,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057902538] [2025-03-04 06:05:26,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:26,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:05:26,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:05:26,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:26,397 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:05:26,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057902538] [2025-03-04 06:05:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057902538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497241568] [2025-03-04 06:05:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:26,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:26,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:26,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:26,399 INFO L87 Difference]: Start difference. First operand 532 states and 730 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:05:30,960 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:05:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:31,446 INFO L93 Difference]: Finished difference Result 1051 states and 1450 transitions. [2025-03-04 06:05:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:31,447 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:05:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:31,449 INFO L225 Difference]: With dead ends: 1051 [2025-03-04 06:05:31,449 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 06:05:31,450 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:05:31,451 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 42 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:31,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3952 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1539 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 06:05:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 06:05:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 530. [2025-03-04 06:05:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 509 states have (on average 1.3791748526522594) internal successors, (702), 514 states have internal predecessors, (702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 727 transitions. [2025-03-04 06:05:31,462 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 727 transitions. Word has length 70 [2025-03-04 06:05:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:31,462 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 727 transitions. [2025-03-04 06:05:31,462 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:05:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 727 transitions. [2025-03-04 06:05:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:05:31,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:31,463 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:05:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:05:31,464 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:05:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2087456900, now seen corresponding path program 1 times [2025-03-04 06:05:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053968066] [2025-03-04 06:05:31,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:31,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:05:31,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:05:31,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:31,683 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:05:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053968066] [2025-03-04 06:05:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053968066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:05:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775998699] [2025-03-04 06:05:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:05:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:31,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:05:31,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:05:31,685 INFO L87 Difference]: Start difference. First operand 530 states and 727 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:05:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:32,393 INFO L93 Difference]: Finished difference Result 1043 states and 1438 transitions. [2025-03-04 06:05:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:32,393 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:05:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:32,396 INFO L225 Difference]: With dead ends: 1043 [2025-03-04 06:05:32,396 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 06:05:32,397 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:05:32,397 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 26 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:32,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4530 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:05:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 06:05:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 536. [2025-03-04 06:05:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 515 states have (on average 1.3766990291262136) internal successors, (709), 520 states have internal predecessors, (709), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 734 transitions. [2025-03-04 06:05:32,412 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 734 transitions. Word has length 70 [2025-03-04 06:05:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 734 transitions. [2025-03-04 06:05:32,412 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:05:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 734 transitions. [2025-03-04 06:05:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:05:32,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:32,413 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:05:32,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:05:32,413 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:05:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1754401810, now seen corresponding path program 1 times [2025-03-04 06:05:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166236632] [2025-03-04 06:05:32,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:32,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:05:32,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:05:32,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:32,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:32,589 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:05:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166236632] [2025-03-04 06:05:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166236632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:05:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984640047] [2025-03-04 06:05:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:05:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:05:32,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:05:32,590 INFO L87 Difference]: Start difference. First operand 536 states and 734 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:05:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:33,277 INFO L93 Difference]: Finished difference Result 1064 states and 1465 transitions. [2025-03-04 06:05:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:33,277 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:05:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:33,279 INFO L225 Difference]: With dead ends: 1064 [2025-03-04 06:05:33,279 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 06:05:33,280 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:05:33,281 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 33 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:33,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3578 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:05:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 06:05:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 533. [2025-03-04 06:05:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 512 states have (on average 1.37890625) internal successors, (706), 517 states have internal predecessors, (706), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:05:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 731 transitions. [2025-03-04 06:05:33,294 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 731 transitions. Word has length 70 [2025-03-04 06:05:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 731 transitions. [2025-03-04 06:05:33,295 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:05:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 731 transitions. [2025-03-04 06:05:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:05:33,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:33,295 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:05:33,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:05:33,296 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:05:33,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1291735459, now seen corresponding path program 1 times [2025-03-04 06:05:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:33,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365309928] [2025-03-04 06:05:33,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:33,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:05:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:05:33,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:50,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-03-04 06:05:50,681 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:05:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365309928] [2025-03-04 06:05:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365309928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:05:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337458722] [2025-03-04 06:05:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:05:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:50,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:05:50,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-04 06:05:50,682 INFO L87 Difference]: Start difference. First operand 533 states and 731 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:05:55,301 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:05:59,307 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:06:03,311 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:06:07,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:11,393 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:06:14,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:18,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-03-04 06:06:20,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:24,676 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:06:28,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:32,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:36,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:06:39,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []