./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:49:27,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:49:27,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:49:27,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:49:27,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:49:27,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:49:27,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:49:27,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:49:27,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:49:27,854 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:49:27,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:49:27,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:49:27,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:49:27,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:49:27,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:49:27,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:49:27,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:49:27,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:49:27,858 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2025-02-06 08:49:28,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:49:28,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:49:28,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:49:28,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:49:28,168 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:49:28,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2025-02-06 08:49:29,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770746e1f/5759b86e07a24258babcb47b3eb154d0/FLAGf0e870335 [2025-02-06 08:49:29,860 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:49:29,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2025-02-06 08:49:29,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770746e1f/5759b86e07a24258babcb47b3eb154d0/FLAGf0e870335 [2025-02-06 08:49:29,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770746e1f/5759b86e07a24258babcb47b3eb154d0 [2025-02-06 08:49:29,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:49:29,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:49:29,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:49:29,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:49:29,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:49:29,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:49:29" (1/1) ... [2025-02-06 08:49:29,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0fd813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:29, skipping insertion in model container [2025-02-06 08:49:29,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:49:29" (1/1) ... [2025-02-06 08:49:29,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:49:30,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2025-02-06 08:49:30,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2025-02-06 08:49:30,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2025-02-06 08:49:30,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2025-02-06 08:49:30,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:49:30,509 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:49:30,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2025-02-06 08:49:30,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2025-02-06 08:49:30,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2025-02-06 08:49:30,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2025-02-06 08:49:30,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:49:30,719 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:49:30,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30 WrapperNode [2025-02-06 08:49:30,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:49:30,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:49:30,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:49:30,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:49:30,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:30,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:30,863 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-02-06 08:49:30,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:49:30,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:49:30,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:49:30,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:49:30,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:30,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:30,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,052 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2025-02-06 08:49:31,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:49:31,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:49:31,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:49:31,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:49:31,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (1/1) ... [2025-02-06 08:49:31,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:49:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:49:31,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:49:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-02-06 08:49:31,204 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:49:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:49:31,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-02-06 08:49:31,205 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:49:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:49:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-02-06 08:49:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-02-06 08:49:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:49:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:49:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:49:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:49:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:49:31,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:49:31,436 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:49:31,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:49:31,479 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-02-06 08:49:32,785 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-02-06 08:49:32,786 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-02-06 08:49:32,786 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:49:32,904 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-02-06 08:49:32,904 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:49:32,959 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:49:32,959 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:49:32,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:32 BoogieIcfgContainer [2025-02-06 08:49:32,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:49:32,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:49:32,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:49:32,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:49:32,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:49:29" (1/3) ... [2025-02-06 08:49:32,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe8513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:32, skipping insertion in model container [2025-02-06 08:49:32,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:30" (2/3) ... [2025-02-06 08:49:32,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe8513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:32, skipping insertion in model container [2025-02-06 08:49:32,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:32" (3/3) ... [2025-02-06 08:49:32,969 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2025-02-06 08:49:32,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:49:32,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-2.i that has 5 procedures, 469 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2025-02-06 08:49:33,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:49:33,071 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;@14c60f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:49:33,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 08:49:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 469 states, 444 states have (on average 1.5945945945945945) internal successors, (708), 449 states have internal predecessors, (708), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 08:49:33,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:33,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:33,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 629085497, now seen corresponding path program 1 times [2025-02-06 08:49:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335670406] [2025-02-06 08:49:33,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:33,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:33,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 08:49:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 08:49:33,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335670406] [2025-02-06 08:49:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335670406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:49:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820027750] [2025-02-06 08:49:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:33,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:49:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:33,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:49:33,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:49:33,320 INFO L87 Difference]: Start difference. First operand has 469 states, 444 states have (on average 1.5945945945945945) internal successors, (708), 449 states have internal predecessors, (708), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:33,449 INFO L93 Difference]: Finished difference Result 934 states and 1487 transitions. [2025-02-06 08:49:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:49:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 08:49:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:33,462 INFO L225 Difference]: With dead ends: 934 [2025-02-06 08:49:33,465 INFO L226 Difference]: Without dead ends: 464 [2025-02-06 08:49:33,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:49:33,475 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:33,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-02-06 08:49:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-02-06 08:49:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 441 states have (on average 1.4285714285714286) internal successors, (630), 445 states have internal predecessors, (630), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 660 transitions. [2025-02-06 08:49:33,577 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 660 transitions. Word has length 8 [2025-02-06 08:49:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 660 transitions. [2025-02-06 08:49:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 660 transitions. [2025-02-06 08:49:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 08:49:33,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:33,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:33,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:49:33,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash -307089900, now seen corresponding path program 1 times [2025-02-06 08:49:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031532047] [2025-02-06 08:49:33,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:33,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 08:49:33,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 08:49:33,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:33,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031532047] [2025-02-06 08:49:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031532047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335211315] [2025-02-06 08:49:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:33,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:33,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:33,828 INFO L87 Difference]: Start difference. First operand 464 states and 660 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:34,172 INFO L93 Difference]: Finished difference Result 1150 states and 1646 transitions. [2025-02-06 08:49:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 08:49:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:34,179 INFO L225 Difference]: With dead ends: 1150 [2025-02-06 08:49:34,180 INFO L226 Difference]: Without dead ends: 901 [2025-02-06 08:49:34,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:49:34,182 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 603 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:34,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1861 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:49:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-02-06 08:49:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 466. [2025-02-06 08:49:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4266365688487586) internal successors, (632), 447 states have internal predecessors, (632), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 662 transitions. [2025-02-06 08:49:34,231 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 662 transitions. Word has length 10 [2025-02-06 08:49:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:34,231 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 662 transitions. [2025-02-06 08:49:34,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 662 transitions. [2025-02-06 08:49:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:49:34,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:34,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:34,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:49:34,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 425259841, now seen corresponding path program 1 times [2025-02-06 08:49:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724496015] [2025-02-06 08:49:34,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:34,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:49:34,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:49:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:34,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:34,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724496015] [2025-02-06 08:49:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724496015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701953250] [2025-02-06 08:49:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:34,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:34,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:34,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:34,568 INFO L87 Difference]: Start difference. First operand 466 states and 662 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:34,777 INFO L93 Difference]: Finished difference Result 931 states and 1323 transitions. [2025-02-06 08:49:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:49:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:34,784 INFO L225 Difference]: With dead ends: 931 [2025-02-06 08:49:34,784 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 08:49:34,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:49:34,786 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 105 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:34,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1686 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:49:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 08:49:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2025-02-06 08:49:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4108352144469527) internal successors, (625), 447 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 655 transitions. [2025-02-06 08:49:34,813 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 655 transitions. Word has length 66 [2025-02-06 08:49:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:34,814 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 655 transitions. [2025-02-06 08:49:34,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 655 transitions. [2025-02-06 08:49:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:49:34,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:34,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:34,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:49:34,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -993137785, now seen corresponding path program 1 times [2025-02-06 08:49:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945212140] [2025-02-06 08:49:34,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:34,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:49:34,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:49:34,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:35,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:35,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945212140] [2025-02-06 08:49:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945212140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:49:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641841590] [2025-02-06 08:49:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:35,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:49:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:35,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:49:35,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:35,373 INFO L87 Difference]: Start difference. First operand 466 states and 655 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:36,122 INFO L93 Difference]: Finished difference Result 962 states and 1351 transitions. [2025-02-06 08:49:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:49:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:49:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:36,125 INFO L225 Difference]: With dead ends: 962 [2025-02-06 08:49:36,126 INFO L226 Difference]: Without dead ends: 500 [2025-02-06 08:49:36,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:36,128 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 14 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:36,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2505 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-06 08:49:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 493. [2025-02-06 08:49:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 470 states have (on average 1.4) internal successors, (658), 474 states have internal predecessors, (658), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 688 transitions. [2025-02-06 08:49:36,150 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 688 transitions. Word has length 66 [2025-02-06 08:49:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:36,150 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 688 transitions. [2025-02-06 08:49:36,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 688 transitions. [2025-02-06 08:49:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:49:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:36,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:36,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:49:36,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1787534617, now seen corresponding path program 1 times [2025-02-06 08:49:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284910959] [2025-02-06 08:49:36,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:49:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:49:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284910959] [2025-02-06 08:49:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284910959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796485257] [2025-02-06 08:49:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:36,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:36,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:36,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:36,541 INFO L87 Difference]: Start difference. First operand 493 states and 688 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:36,826 INFO L93 Difference]: Finished difference Result 991 states and 1386 transitions. [2025-02-06 08:49:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:49:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:36,833 INFO L225 Difference]: With dead ends: 991 [2025-02-06 08:49:36,833 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 08:49:36,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:36,840 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 17 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:36,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1639 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:49:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 08:49:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 494. [2025-02-06 08:49:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 471 states have (on average 1.3991507430997876) internal successors, (659), 475 states have internal predecessors, (659), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 689 transitions. [2025-02-06 08:49:36,863 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 689 transitions. Word has length 67 [2025-02-06 08:49:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:36,863 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 689 transitions. [2025-02-06 08:49:36,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 689 transitions. [2025-02-06 08:49:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:49:36,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:36,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:36,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:49:36,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash -941440, now seen corresponding path program 1 times [2025-02-06 08:49:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204492439] [2025-02-06 08:49:36,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:36,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:49:36,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:49:36,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204492439] [2025-02-06 08:49:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204492439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792659779] [2025-02-06 08:49:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:37,168 INFO L87 Difference]: Start difference. First operand 494 states and 689 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:37,822 INFO L93 Difference]: Finished difference Result 996 states and 1393 transitions. [2025-02-06 08:49:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:49:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:37,825 INFO L225 Difference]: With dead ends: 996 [2025-02-06 08:49:37,826 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 08:49:37,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:37,827 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 14 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:37,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3010 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 08:49:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2025-02-06 08:49:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 480 states have (on average 1.4) internal successors, (672), 484 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 702 transitions. [2025-02-06 08:49:37,850 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 702 transitions. Word has length 67 [2025-02-06 08:49:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:37,851 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 702 transitions. [2025-02-06 08:49:37,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 702 transitions. [2025-02-06 08:49:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:37,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:37,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:37,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:49:37,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:37,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1713217380, now seen corresponding path program 1 times [2025-02-06 08:49:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:37,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369296170] [2025-02-06 08:49:37,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:37,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:37,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:38,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369296170] [2025-02-06 08:49:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369296170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:38,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:49:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928275571] [2025-02-06 08:49:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:38,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:49:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:38,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:49:38,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:38,092 INFO L87 Difference]: Start difference. First operand 503 states and 702 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:38,634 INFO L93 Difference]: Finished difference Result 1005 states and 1405 transitions. [2025-02-06 08:49:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:49:38,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:38,637 INFO L225 Difference]: With dead ends: 1005 [2025-02-06 08:49:38,637 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 08:49:38,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:38,639 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 8 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:38,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2534 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 08:49:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-02-06 08:49:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 483 states have (on average 1.3975155279503106) internal successors, (675), 487 states have internal predecessors, (675), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 705 transitions. [2025-02-06 08:49:38,661 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 705 transitions. Word has length 68 [2025-02-06 08:49:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 705 transitions. [2025-02-06 08:49:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 705 transitions. [2025-02-06 08:49:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:38,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:38,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:49:38,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:38,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1561271424, now seen corresponding path program 1 times [2025-02-06 08:49:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588254084] [2025-02-06 08:49:38,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:38,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:38,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:38,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:38,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588254084] [2025-02-06 08:49:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588254084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027066846] [2025-02-06 08:49:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:39,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:39,073 INFO L87 Difference]: Start difference. First operand 506 states and 705 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:40,013 INFO L93 Difference]: Finished difference Result 1024 states and 1431 transitions. [2025-02-06 08:49:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:40,017 INFO L225 Difference]: With dead ends: 1024 [2025-02-06 08:49:40,017 INFO L226 Difference]: Without dead ends: 522 [2025-02-06 08:49:40,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:49:40,020 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 33 mSDsluCounter, 3493 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:40,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4086 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:49:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-06 08:49:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 516. [2025-02-06 08:49:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-02-06 08:49:40,041 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 68 [2025-02-06 08:49:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-02-06 08:49:40,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-02-06 08:49:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:40,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:40,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:49:40,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2090436, now seen corresponding path program 1 times [2025-02-06 08:49:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029670313] [2025-02-06 08:49:40,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:40,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:40,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:40,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:40,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:40,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029670313] [2025-02-06 08:49:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029670313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:49:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654128770] [2025-02-06 08:49:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:49:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:49:40,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:40,498 INFO L87 Difference]: Start difference. First operand 516 states and 719 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:41,177 INFO L93 Difference]: Finished difference Result 1034 states and 1443 transitions. [2025-02-06 08:49:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:49:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:41,182 INFO L225 Difference]: With dead ends: 1034 [2025-02-06 08:49:41,182 INFO L226 Difference]: Without dead ends: 522 [2025-02-06 08:49:41,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:41,183 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 27 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3107 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-06 08:49:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-02-06 08:49:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3951612903225807) internal successors, (692), 500 states have internal predecessors, (692), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 722 transitions. [2025-02-06 08:49:41,203 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 722 transitions. Word has length 68 [2025-02-06 08:49:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 722 transitions. [2025-02-06 08:49:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 722 transitions. [2025-02-06 08:49:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:49:41,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:41,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:41,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:49:41,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:41,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1389420454, now seen corresponding path program 1 times [2025-02-06 08:49:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737266804] [2025-02-06 08:49:41,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:41,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:49:41,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:49:41,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:41,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737266804] [2025-02-06 08:49:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737266804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486819545] [2025-02-06 08:49:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:41,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:41,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:41,517 INFO L87 Difference]: Start difference. First operand 519 states and 722 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:42,210 INFO L93 Difference]: Finished difference Result 1041 states and 1451 transitions. [2025-02-06 08:49:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:49:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:42,213 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 08:49:42,213 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 08:49:42,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:42,216 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 12 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:42,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3013 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 08:49:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 519. [2025-02-06 08:49:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3951612903225807) internal successors, (692), 500 states have internal predecessors, (692), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 722 transitions. [2025-02-06 08:49:42,236 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 722 transitions. Word has length 69 [2025-02-06 08:49:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 722 transitions. [2025-02-06 08:49:42,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 722 transitions. [2025-02-06 08:49:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:49:42,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:42,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:42,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:49:42,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:42,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1770865388, now seen corresponding path program 1 times [2025-02-06 08:49:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042342812] [2025-02-06 08:49:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:42,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:49:42,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:49:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:42,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042342812] [2025-02-06 08:49:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042342812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560246593] [2025-02-06 08:49:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:42,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:42,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:42,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:42,761 INFO L87 Difference]: Start difference. First operand 519 states and 722 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:44,170 INFO L93 Difference]: Finished difference Result 1527 states and 2138 transitions. [2025-02-06 08:49:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:49:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:49:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:44,176 INFO L225 Difference]: With dead ends: 1527 [2025-02-06 08:49:44,177 INFO L226 Difference]: Without dead ends: 1012 [2025-02-06 08:49:44,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:49:44,178 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 905 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:44,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3745 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 08:49:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-02-06 08:49:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 550. [2025-02-06 08:49:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.381404174573055) internal successors, (728), 531 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 758 transitions. [2025-02-06 08:49:44,201 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 758 transitions. Word has length 69 [2025-02-06 08:49:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:44,201 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 758 transitions. [2025-02-06 08:49:44,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 758 transitions. [2025-02-06 08:49:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:49:44,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:44,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:49:44,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1468094950, now seen corresponding path program 1 times [2025-02-06 08:49:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023583710] [2025-02-06 08:49:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:44,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:49:44,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:49:44,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:44,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023583710] [2025-02-06 08:49:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023583710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958780198] [2025-02-06 08:49:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:44,470 INFO L87 Difference]: Start difference. First operand 550 states and 758 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:45,372 INFO L93 Difference]: Finished difference Result 1093 states and 1515 transitions. [2025-02-06 08:49:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:49:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:45,376 INFO L225 Difference]: With dead ends: 1093 [2025-02-06 08:49:45,376 INFO L226 Difference]: Without dead ends: 578 [2025-02-06 08:49:45,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:45,378 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 37 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:45,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3999 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 08:49:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-06 08:49:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 553. [2025-02-06 08:49:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 530 states have (on average 1.381132075471698) internal successors, (732), 534 states have internal predecessors, (732), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2025-02-06 08:49:45,402 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 70 [2025-02-06 08:49:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:45,402 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2025-02-06 08:49:45,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2025-02-06 08:49:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:49:45,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:45,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:49:45,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -381596387, now seen corresponding path program 1 times [2025-02-06 08:49:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716994865] [2025-02-06 08:49:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:45,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:49:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:49:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716994865] [2025-02-06 08:49:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716994865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:45,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944090444] [2025-02-06 08:49:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:45,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:45,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:45,685 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:46,270 INFO L93 Difference]: Finished difference Result 1084 states and 1502 transitions. [2025-02-06 08:49:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:49:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:46,274 INFO L225 Difference]: With dead ends: 1084 [2025-02-06 08:49:46,274 INFO L226 Difference]: Without dead ends: 566 [2025-02-06 08:49:46,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:46,277 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 20 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:46,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3169 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-06 08:49:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 553. [2025-02-06 08:49:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 530 states have (on average 1.381132075471698) internal successors, (732), 534 states have internal predecessors, (732), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2025-02-06 08:49:46,297 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 70 [2025-02-06 08:49:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2025-02-06 08:49:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2025-02-06 08:49:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:46,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:49:46,302 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:46,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1121106445, now seen corresponding path program 1 times [2025-02-06 08:49:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35731718] [2025-02-06 08:49:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:46,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:46,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:46,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35731718] [2025-02-06 08:49:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35731718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:46,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359858621] [2025-02-06 08:49:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:46,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:46,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:46,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:46,630 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:47,508 INFO L93 Difference]: Finished difference Result 1092 states and 1514 transitions. [2025-02-06 08:49:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:47,512 INFO L225 Difference]: With dead ends: 1092 [2025-02-06 08:49:47,512 INFO L226 Difference]: Without dead ends: 574 [2025-02-06 08:49:47,513 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-02-06 08:49:47,513 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 17 mSDsluCounter, 3911 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4494 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:47,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4494 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 08:49:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-06 08:49:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 566. [2025-02-06 08:49:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 543 states have (on average 1.3793738489871086) internal successors, (749), 547 states have internal predecessors, (749), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 779 transitions. [2025-02-06 08:49:47,551 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 779 transitions. Word has length 71 [2025-02-06 08:49:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:47,551 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 779 transitions. [2025-02-06 08:49:47,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 779 transitions. [2025-02-06 08:49:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:47,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:47,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:47,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:49:47,554 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:47,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1309251437, now seen corresponding path program 1 times [2025-02-06 08:49:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227789307] [2025-02-06 08:49:47,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:47,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:47,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:47,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:47,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227789307] [2025-02-06 08:49:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227789307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868071746] [2025-02-06 08:49:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:47,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:47,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:47,836 INFO L87 Difference]: Start difference. First operand 566 states and 779 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:48,476 INFO L93 Difference]: Finished difference Result 1101 states and 1523 transitions. [2025-02-06 08:49:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:48,480 INFO L225 Difference]: With dead ends: 1101 [2025-02-06 08:49:48,480 INFO L226 Difference]: Without dead ends: 570 [2025-02-06 08:49:48,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:48,482 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 11 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:48,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3055 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-06 08:49:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2025-02-06 08:49:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 540 states have (on average 1.3777777777777778) internal successors, (744), 544 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 774 transitions. [2025-02-06 08:49:48,504 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 774 transitions. Word has length 71 [2025-02-06 08:49:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:48,504 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 774 transitions. [2025-02-06 08:49:48,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 774 transitions. [2025-02-06 08:49:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:48,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:48,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:48,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:49:48,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:48,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1426534871, now seen corresponding path program 1 times [2025-02-06 08:49:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:48,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989649188] [2025-02-06 08:49:48,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:48,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:48,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:48,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:48,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:48,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:48,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989649188] [2025-02-06 08:49:48,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989649188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982781674] [2025-02-06 08:49:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:48,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:48,749 INFO L87 Difference]: Start difference. First operand 563 states and 774 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:49,440 INFO L93 Difference]: Finished difference Result 1096 states and 1516 transitions. [2025-02-06 08:49:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:49,444 INFO L225 Difference]: With dead ends: 1096 [2025-02-06 08:49:49,445 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 08:49:49,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:49,447 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 8 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:49,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2983 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 08:49:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2025-02-06 08:49:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 544 states have (on average 1.3768382352941178) internal successors, (749), 548 states have internal predecessors, (749), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 779 transitions. [2025-02-06 08:49:49,467 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 779 transitions. Word has length 71 [2025-02-06 08:49:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:49,467 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 779 transitions. [2025-02-06 08:49:49,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2025-02-06 08:49:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:49,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:49,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:49,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:49:49,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:49,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash -354968949, now seen corresponding path program 1 times [2025-02-06 08:49:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443385148] [2025-02-06 08:49:49,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:49,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:49,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:49,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443385148] [2025-02-06 08:49:49,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443385148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:49,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:49,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:49,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826813170] [2025-02-06 08:49:49,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:49,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:49,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:49,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:49,980 INFO L87 Difference]: Start difference. First operand 567 states and 779 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:54,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:49:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:55,431 INFO L93 Difference]: Finished difference Result 1119 states and 1545 transitions. [2025-02-06 08:49:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:55,435 INFO L225 Difference]: With dead ends: 1119 [2025-02-06 08:49:55,435 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 08:49:55,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:49:55,437 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 42 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:55,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4441 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1523 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-06 08:49:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 08:49:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 564. [2025-02-06 08:49:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 541 states have (on average 1.3752310536044363) internal successors, (744), 545 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 774 transitions. [2025-02-06 08:49:55,461 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 774 transitions. Word has length 72 [2025-02-06 08:49:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:55,461 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 774 transitions. [2025-02-06 08:49:55,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 774 transitions. [2025-02-06 08:49:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:55,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:55,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:55,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:49:55,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:55,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -270138913, now seen corresponding path program 1 times [2025-02-06 08:49:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606371879] [2025-02-06 08:49:55,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:55,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:55,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606371879] [2025-02-06 08:49:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606371879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:55,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 08:49:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340778397] [2025-02-06 08:49:55,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:55,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:49:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:55,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:49:55,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:55,793 INFO L87 Difference]: Start difference. First operand 564 states and 774 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:56,858 INFO L93 Difference]: Finished difference Result 1110 states and 1531 transitions. [2025-02-06 08:49:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:56,862 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 08:49:56,862 INFO L226 Difference]: Without dead ends: 581 [2025-02-06 08:49:56,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:56,864 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 26 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5064 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:56,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5064 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:49:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-06 08:49:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 570. [2025-02-06 08:49:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 547 states have (on average 1.3729433272394882) internal successors, (751), 551 states have internal predecessors, (751), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 781 transitions. [2025-02-06 08:49:56,886 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 781 transitions. Word has length 72 [2025-02-06 08:49:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:56,886 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 781 transitions. [2025-02-06 08:49:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 781 transitions. [2025-02-06 08:49:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:56,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:56,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:56,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:49:56,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1431603191, now seen corresponding path program 1 times [2025-02-06 08:49:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687221476] [2025-02-06 08:49:56,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:56,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:56,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687221476] [2025-02-06 08:49:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687221476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401984870] [2025-02-06 08:49:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:57,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:57,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:57,147 INFO L87 Difference]: Start difference. First operand 570 states and 781 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:58,113 INFO L93 Difference]: Finished difference Result 1131 states and 1558 transitions. [2025-02-06 08:49:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:58,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:58,116 INFO L225 Difference]: With dead ends: 1131 [2025-02-06 08:49:58,116 INFO L226 Difference]: Without dead ends: 596 [2025-02-06 08:49:58,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:58,118 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 33 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:58,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4018 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:49:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-06 08:49:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 567. [2025-02-06 08:49:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 544 states have (on average 1.375) internal successors, (748), 548 states have internal predecessors, (748), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:49:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 778 transitions. [2025-02-06 08:49:58,136 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 778 transitions. Word has length 72 [2025-02-06 08:49:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:58,136 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 778 transitions. [2025-02-06 08:49:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 778 transitions. [2025-02-06 08:49:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:58,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:49:58,138 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1315997383, now seen corresponding path program 1 times [2025-02-06 08:49:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799702577] [2025-02-06 08:49:58,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:58,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:58,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:58,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:58,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:50:20,212 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 08:50:44,308 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)