./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:32:04,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:32:04,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:32:04,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:32:04,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:32:04,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:32:04,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:32:04,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:32:04,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:32:04,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:32:04,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:32:04,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:32:04,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:32:04,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:32:04,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:32:04,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:32:04,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:32:04,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b [2025-03-03 13:32:04,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:32:04,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:32:04,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:32:04,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:32:04,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:32:04,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2025-03-03 13:32:05,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094654256/cc638d7de9dc48b1a524c0b28dd382e1/FLAG091347317 [2025-03-03 13:32:05,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:32:05,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2025-03-03 13:32:05,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094654256/cc638d7de9dc48b1a524c0b28dd382e1/FLAG091347317 [2025-03-03 13:32:05,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094654256/cc638d7de9dc48b1a524c0b28dd382e1 [2025-03-03 13:32:05,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:32:05,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:32:05,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:32:05,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:32:05,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:32:05,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:32:05" (1/1) ... [2025-03-03 13:32:05,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539ed2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:05, skipping insertion in model container [2025-03-03 13:32:05,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:32:05" (1/1) ... [2025-03-03 13:32:05,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:32:05,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2025-03-03 13:32:05,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2025-03-03 13:32:05,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2025-03-03 13:32:05,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2025-03-03 13:32:05,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2025-03-03 13:32:05,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2025-03-03 13:32:05,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2025-03-03 13:32:05,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2025-03-03 13:32:05,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2025-03-03 13:32:05,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2025-03-03 13:32:05,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2025-03-03 13:32:05,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2025-03-03 13:32:05,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2025-03-03 13:32:05,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2025-03-03 13:32:06,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2025-03-03 13:32:06,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2025-03-03 13:32:06,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:32:06,135 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:32:06,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2025-03-03 13:32:06,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2025-03-03 13:32:06,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2025-03-03 13:32:06,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2025-03-03 13:32:06,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2025-03-03 13:32:06,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2025-03-03 13:32:06,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2025-03-03 13:32:06,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2025-03-03 13:32:06,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2025-03-03 13:32:06,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2025-03-03 13:32:06,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2025-03-03 13:32:06,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2025-03-03 13:32:06,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2025-03-03 13:32:06,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2025-03-03 13:32:06,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2025-03-03 13:32:06,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2025-03-03 13:32:06,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:32:06,248 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:32:06,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06 WrapperNode [2025-03-03 13:32:06,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:32:06,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:32:06,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:32:06,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:32:06,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,305 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2017 [2025-03-03 13:32:06,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:32:06,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:32:06,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:32:06,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:32:06,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,346 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:32:06,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:32:06,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:32:06,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:32:06,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:32:06,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (1/1) ... [2025-03-03 13:32:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:32:06,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:06,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:32:06,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:32:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:32:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:32:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:32:06,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:32:06,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:32:06,573 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:32:07,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-03 13:32:07,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-03-03 13:32:07,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1; [2025-03-03 13:32:07,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2628: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~main____CPAchecker_TMP_1~59#1;havoc main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1;havoc main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~main____CPAchecker_TMP_1~58#1;havoc main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1;havoc main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~main____CPAchecker_TMP_1~57#1;havoc main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1;havoc main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~main____CPAchecker_TMP_1~56#1;havoc main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1;havoc main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~main____CPAchecker_TMP_1~55#1;havoc main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1;havoc main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~main____CPAchecker_TMP_1~54#1;havoc main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1;havoc main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~main____CPAchecker_TMP_1~53#1;havoc main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1;havoc main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~main____CPAchecker_TMP_1~52#1;havoc main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1;havoc main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~main____CPAchecker_TMP_1~51#1;havoc main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1;havoc main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~main____CPAchecker_TMP_1~50#1;havoc main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1;havoc main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~main____CPAchecker_TMP_1~49#1;havoc main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1;havoc main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~main____CPAchecker_TMP_1~48#1;havoc main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1;havoc main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~main____CPAchecker_TMP_1~47#1;havoc main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1;havoc main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~main____CPAchecker_TMP_1~46#1;havoc main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1;havoc main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~main____CPAchecker_TMP_1~45#1;havoc main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1;havoc main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~main____CPAchecker_TMP_1~44#1;havoc main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1;havoc main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~main____CPAchecker_TMP_1~43#1;havoc main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1;havoc main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~main____CPAchecker_TMP_1~42#1;havoc main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1;havoc main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~main____CPAchecker_TMP_1~41#1;havoc main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1;havoc main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~main____CPAchecker_TMP_1~40#1;havoc main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1;havoc main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~main____CPAchecker_TMP_1~39#1;havoc main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1;havoc main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~main____CPAchecker_TMP_1~38#1;havoc main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1;havoc main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~main____CPAchecker_TMP_1~37#1;havoc main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1;havoc main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~main____CPAchecker_TMP_1~36#1;havoc main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1;havoc main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~main____CPAchecker_TMP_1~35#1;havoc main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1;havoc main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~main____CPAchecker_TMP_1~34#1;havoc main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1;havoc main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~main____CPAchecker_TMP_1~33#1;havoc main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1;havoc main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~main____CPAchecker_TMP_1~32#1;havoc main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1;havoc main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~main____CPAchecker_TMP_1~31#1;havoc main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1;havoc main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~main____CPAchecker_TMP_1~30#1;havoc main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1;havoc main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~main____CPAchecker_TMP_1~29#1;havoc main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1;havoc main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~main____CPAchecker_TMP_1~28#1;havoc main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1;havoc main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~main____CPAchecker_TMP_1~27#1;havoc main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1;havoc main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~main____CPAchecker_TMP_1~26#1;havoc main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1;havoc main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~main____CPAchecker_TMP_1~25#1;havoc main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1;havoc main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~main____CPAchecker_TMP_1~24#1;havoc main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1;havoc main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~main____CPAchecker_TMP_1~23#1;havoc main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1;havoc main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~main____CPAchecker_TMP_1~22#1;havoc main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1;havoc main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~main____CPAchecker_TMP_1~21#1;havoc main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1;havoc main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~main____CPAchecker_TMP_1~20#1;havoc main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1;havoc main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~main____CPAchecker_TMP_1~19#1;havoc main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1;havoc main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~main____CPAchecker_TMP_1~18#1;havoc main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1;havoc main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~main____CPAchecker_TMP_1~17#1;havoc main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1;havoc main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~main____CPAchecker_TMP_1~16#1;havoc main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1;havoc main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~main____CPAchecker_TMP_1~15#1;havoc main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1;havoc main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~main____CPAchecker_TMP_1~14#1;havoc main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1;havoc main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~main____CPAchecker_TMP_1~13#1;havoc main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1;havoc main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~main____CPAchecker_TMP_1~12#1;havoc main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1;havoc main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~main____CPAchecker_TMP_1~11#1;havoc main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1;havoc main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~main____CPAchecker_TMP_1~10#1;havoc main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1;havoc main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~main____CPAchecker_TMP_1~9#1;havoc main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1;havoc main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~main____CPAchecker_TMP_1~8#1;havoc main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1;havoc main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~main____CPAchecker_TMP_1~7#1;havoc main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1;havoc main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~main____CPAchecker_TMP_1~6#1;havoc main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1;havoc main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~main____CPAchecker_TMP_1~5#1;havoc main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1;havoc main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~main____CPAchecker_TMP_1~4#1;havoc main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1;havoc main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~main____CPAchecker_TMP_1~3#1;havoc main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1;havoc main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~main____CPAchecker_TMP_1~2#1;havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1;havoc main_~main____CPAchecker_TMP_4~0#1; [2025-03-03 13:32:07,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-03-03 13:32:07,580 INFO L? ?]: Removed 607 outVars from TransFormulas that were not future-live. [2025-03-03 13:32:07,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:32:07,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:32:07,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:32:07,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:32:07 BoogieIcfgContainer [2025-03-03 13:32:07,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:32:07,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:32:07,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:32:07,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:32:07,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:32:05" (1/3) ... [2025-03-03 13:32:07,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b22aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:32:07, skipping insertion in model container [2025-03-03 13:32:07,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:06" (2/3) ... [2025-03-03 13:32:07,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b22aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:32:07, skipping insertion in model container [2025-03-03 13:32:07,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:32:07" (3/3) ... [2025-03-03 13:32:07,607 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2025-03-03 13:32:07,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:32:07,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+nlh-reducer.c that has 1 procedures, 304 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-03 13:32:07,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:32:07,675 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;@28c62c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:32:07,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-03 13:32:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:32:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:07,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:07,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:07,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 410967975, now seen corresponding path program 1 times [2025-03-03 13:32:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082609645] [2025-03-03 13:32:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:07,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:32:07,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:32:07,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:07,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082609645] [2025-03-03 13:32:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082609645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:07,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868117278] [2025-03-03 13:32:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:07,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:07,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:07,907 INFO L87 Difference]: Start difference. First operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:08,378 INFO L93 Difference]: Finished difference Result 308 states and 568 transitions. [2025-03-03 13:32:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:08,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-03 13:32:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:08,385 INFO L225 Difference]: With dead ends: 308 [2025-03-03 13:32:08,386 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 13:32:08,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:08,389 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 460 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:08,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 467 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:32:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 13:32:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-03 13:32:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 283 states have (on average 1.4876325088339222) internal successors, (421), 297 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 421 transitions. [2025-03-03 13:32:08,424 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 421 transitions. Word has length 7 [2025-03-03 13:32:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 421 transitions. [2025-03-03 13:32:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 421 transitions. [2025-03-03 13:32:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:32:08,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:08,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:08,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:32:08,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -142461576, now seen corresponding path program 1 times [2025-03-03 13:32:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:08,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461863679] [2025-03-03 13:32:08,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:08,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:32:08,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:32:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461863679] [2025-03-03 13:32:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461863679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203654263] [2025-03-03 13:32:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:08,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:08,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:08,499 INFO L87 Difference]: Start difference. First operand 298 states and 421 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:08,874 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2025-03-03 13:32:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:08,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:32:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:08,876 INFO L225 Difference]: With dead ends: 298 [2025-03-03 13:32:08,876 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 13:32:08,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:08,877 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 339 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:08,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 204 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:32:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 13:32:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-03 13:32:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 282 states have (on average 1.4858156028368794) internal successors, (419), 295 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 419 transitions. [2025-03-03 13:32:08,888 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 419 transitions. Word has length 8 [2025-03-03 13:32:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 419 transitions. [2025-03-03 13:32:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 419 transitions. [2025-03-03 13:32:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:32:08,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:08,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:08,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:32:08,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:08,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -144895399, now seen corresponding path program 1 times [2025-03-03 13:32:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523177028] [2025-03-03 13:32:08,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:08,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:32:08,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:32:08,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:08,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523177028] [2025-03-03 13:32:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523177028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:08,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:08,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134660530] [2025-03-03 13:32:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:08,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:08,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:08,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:08,970 INFO L87 Difference]: Start difference. First operand 296 states and 419 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:09,312 INFO L93 Difference]: Finished difference Result 301 states and 424 transitions. [2025-03-03 13:32:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:32:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:09,313 INFO L225 Difference]: With dead ends: 301 [2025-03-03 13:32:09,313 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 13:32:09,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:09,314 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 12 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:09,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 987 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 13:32:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2025-03-03 13:32:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 290 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2025-03-03 13:32:09,320 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 8 [2025-03-03 13:32:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:09,320 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2025-03-03 13:32:09,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2025-03-03 13:32:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:32:09,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:09,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:32:09,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -121339458, now seen corresponding path program 1 times [2025-03-03 13:32:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985322426] [2025-03-03 13:32:09,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:32:09,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:32:09,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:09,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:09,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985322426] [2025-03-03 13:32:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985322426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839070002] [2025-03-03 13:32:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:09,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:09,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:09,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:09,401 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:09,623 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2025-03-03 13:32:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:09,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-03 13:32:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:09,625 INFO L225 Difference]: With dead ends: 296 [2025-03-03 13:32:09,625 INFO L226 Difference]: Without dead ends: 294 [2025-03-03 13:32:09,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:09,627 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 3 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:09,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 785 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:32:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-03 13:32:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-03 13:32:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 293 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2025-03-03 13:32:09,638 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 9 [2025-03-03 13:32:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:09,638 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2025-03-03 13:32:09,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2025-03-03 13:32:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:32:09,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:09,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:09,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:32:09,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:09,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -643115322, now seen corresponding path program 1 times [2025-03-03 13:32:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381262108] [2025-03-03 13:32:09,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:09,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:32:09,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:32:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381262108] [2025-03-03 13:32:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381262108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576173235] [2025-03-03 13:32:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:09,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:09,691 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:10,075 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2025-03-03 13:32:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2025-03-03 13:32:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:10,076 INFO L225 Difference]: With dead ends: 294 [2025-03-03 13:32:10,076 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 13:32:10,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:10,077 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 275 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:10,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 286 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:32:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 13:32:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-03 13:32:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2025-03-03 13:32:10,083 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 11 [2025-03-03 13:32:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:10,083 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2025-03-03 13:32:10,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2025-03-03 13:32:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:32:10,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:10,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:10,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:32:10,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:10,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1538260757, now seen corresponding path program 1 times [2025-03-03 13:32:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:10,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172724117] [2025-03-03 13:32:10,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:32:10,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:32:10,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:10,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172724117] [2025-03-03 13:32:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172724117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980264886] [2025-03-03 13:32:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:10,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:10,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:10,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:10,143 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:10,344 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2025-03-03 13:32:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-03 13:32:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:10,346 INFO L225 Difference]: With dead ends: 292 [2025-03-03 13:32:10,346 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 13:32:10,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:10,347 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:10,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 768 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:32:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 13:32:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-03 13:32:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2025-03-03 13:32:10,353 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 12 [2025-03-03 13:32:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2025-03-03 13:32:10,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2025-03-03 13:32:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:32:10,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:10,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:10,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:32:10,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:10,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -812792978, now seen corresponding path program 1 times [2025-03-03 13:32:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406488428] [2025-03-03 13:32:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:10,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:32:10,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:32:10,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:10,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:10,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406488428] [2025-03-03 13:32:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406488428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:10,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082401712] [2025-03-03 13:32:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:10,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:10,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:10,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:10,479 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:10,875 INFO L93 Difference]: Finished difference Result 313 states and 379 transitions. [2025-03-03 13:32:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:32:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-03-03 13:32:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:10,876 INFO L225 Difference]: With dead ends: 313 [2025-03-03 13:32:10,876 INFO L226 Difference]: Without dead ends: 311 [2025-03-03 13:32:10,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:32:10,877 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 26 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:10,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 920 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:32:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-03 13:32:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2025-03-03 13:32:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2025-03-03 13:32:10,883 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 13 [2025-03-03 13:32:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:10,883 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2025-03-03 13:32:10,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2025-03-03 13:32:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:32:10,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:10,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:10,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:32:10,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:10,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:10,885 INFO L85 PathProgramCache]: Analyzing trace with hash 513414284, now seen corresponding path program 1 times [2025-03-03 13:32:10,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:10,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955716354] [2025-03-03 13:32:10,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:10,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:32:10,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:32:10,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:10,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955716354] [2025-03-03 13:32:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955716354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:10,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380630223] [2025-03-03 13:32:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:10,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:10,939 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:11,300 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2025-03-03 13:32:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-03 13:32:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:11,301 INFO L225 Difference]: With dead ends: 291 [2025-03-03 13:32:11,301 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 13:32:11,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:11,302 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 270 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:11,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 272 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 13:32:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-03-03 13:32:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 285 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2025-03-03 13:32:11,306 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 13 [2025-03-03 13:32:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2025-03-03 13:32:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2025-03-03 13:32:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:32:11,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:11,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:32:11,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 514029998, now seen corresponding path program 1 times [2025-03-03 13:32:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871876724] [2025-03-03 13:32:11,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:11,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:32:11,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:32:11,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:11,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871876724] [2025-03-03 13:32:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871876724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995768872] [2025-03-03 13:32:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:11,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:11,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:11,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:11,360 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:11,713 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2025-03-03 13:32:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-03 13:32:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:11,718 INFO L225 Difference]: With dead ends: 289 [2025-03-03 13:32:11,718 INFO L226 Difference]: Without dead ends: 287 [2025-03-03 13:32:11,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:11,718 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 268 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:11,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 266 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-03 13:32:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2025-03-03 13:32:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 283 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2025-03-03 13:32:11,722 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 13 [2025-03-03 13:32:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2025-03-03 13:32:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2025-03-03 13:32:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:32:11,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:11,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:11,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 13:32:11,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1264026050, now seen corresponding path program 1 times [2025-03-03 13:32:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695818427] [2025-03-03 13:32:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:32:11,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:32:11,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:11,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:11,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695818427] [2025-03-03 13:32:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695818427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513404312] [2025-03-03 13:32:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:11,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:11,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:11,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:11,837 INFO L87 Difference]: Start difference. First operand 284 states and 347 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:12,195 INFO L93 Difference]: Finished difference Result 303 states and 369 transitions. [2025-03-03 13:32:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:32:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-03-03 13:32:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:12,196 INFO L225 Difference]: With dead ends: 303 [2025-03-03 13:32:12,196 INFO L226 Difference]: Without dead ends: 301 [2025-03-03 13:32:12,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:12,197 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 19 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:12,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 900 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-03 13:32:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2025-03-03 13:32:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2614840989399294) internal successors, (357), 291 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2025-03-03 13:32:12,201 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 14 [2025-03-03 13:32:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:12,201 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2025-03-03 13:32:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2025-03-03 13:32:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:32:12,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:12,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:12,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 13:32:12,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:12,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1263971408, now seen corresponding path program 1 times [2025-03-03 13:32:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186960463] [2025-03-03 13:32:12,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:32:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:32:12,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186960463] [2025-03-03 13:32:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186960463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:12,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093921281] [2025-03-03 13:32:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:12,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:12,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:12,246 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:12,575 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2025-03-03 13:32:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2025-03-03 13:32:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:12,577 INFO L225 Difference]: With dead ends: 292 [2025-03-03 13:32:12,577 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 13:32:12,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:12,577 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 265 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:12,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 260 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 13:32:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-03 13:32:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2025-03-03 13:32:12,581 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 14 [2025-03-03 13:32:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2025-03-03 13:32:12,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2025-03-03 13:32:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:32:12,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:12,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:12,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 13:32:12,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:12,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1244939916, now seen corresponding path program 1 times [2025-03-03 13:32:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:12,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135391108] [2025-03-03 13:32:12,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:32:12,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:32:12,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:12,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:12,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135391108] [2025-03-03 13:32:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135391108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387401993] [2025-03-03 13:32:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:12,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:12,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:12,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:12,664 INFO L87 Difference]: Start difference. First operand 290 states and 355 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:13,017 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2025-03-03 13:32:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:32:13,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-03-03 13:32:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:13,019 INFO L225 Difference]: With dead ends: 300 [2025-03-03 13:32:13,019 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 13:32:13,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:13,019 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 17 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 890 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 13:32:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2025-03-03 13:32:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 356 transitions. [2025-03-03 13:32:13,024 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 356 transitions. Word has length 14 [2025-03-03 13:32:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 356 transitions. [2025-03-03 13:32:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 356 transitions. [2025-03-03 13:32:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:32:13,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:13,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:13,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 13:32:13,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -528408622, now seen corresponding path program 1 times [2025-03-03 13:32:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614327842] [2025-03-03 13:32:13,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:32:13,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:32:13,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:13,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614327842] [2025-03-03 13:32:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614327842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:13,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:13,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6768895] [2025-03-03 13:32:13,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:13,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:13,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:13,124 INFO L87 Difference]: Start difference. First operand 291 states and 356 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:13,393 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2025-03-03 13:32:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:32:13,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-03-03 13:32:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:13,394 INFO L225 Difference]: With dead ends: 296 [2025-03-03 13:32:13,394 INFO L226 Difference]: Without dead ends: 294 [2025-03-03 13:32:13,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:13,395 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 17 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:13,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 811 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-03 13:32:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-03 13:32:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 286 states have (on average 1.2552447552447552) internal successors, (359), 293 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2025-03-03 13:32:13,399 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 15 [2025-03-03 13:32:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:13,399 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2025-03-03 13:32:13,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2025-03-03 13:32:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:32:13,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:13,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:13,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 13:32:13,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 746698374, now seen corresponding path program 1 times [2025-03-03 13:32:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261719199] [2025-03-03 13:32:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:32:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:32:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261719199] [2025-03-03 13:32:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261719199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928159872] [2025-03-03 13:32:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:13,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:13,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:13,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:13,435 INFO L87 Difference]: Start difference. First operand 294 states and 359 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:13,566 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2025-03-03 13:32:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-03 13:32:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:13,568 INFO L225 Difference]: With dead ends: 294 [2025-03-03 13:32:13,568 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 13:32:13,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:13,568 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 321 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:13,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 426 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 13:32:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-03 13:32:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.2526315789473683) internal successors, (357), 291 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2025-03-03 13:32:13,572 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 16 [2025-03-03 13:32:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:13,572 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2025-03-03 13:32:13,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2025-03-03 13:32:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:32:13,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:13,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 13:32:13,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:13,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1872577314, now seen corresponding path program 1 times [2025-03-03 13:32:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848420375] [2025-03-03 13:32:13,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:13,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:32:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:32:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848420375] [2025-03-03 13:32:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848420375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:13,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498467310] [2025-03-03 13:32:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:13,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:13,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:13,636 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:13,946 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2025-03-03 13:32:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-03 13:32:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:13,947 INFO L225 Difference]: With dead ends: 292 [2025-03-03 13:32:13,947 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 13:32:13,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:32:13,948 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 464 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:13,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 178 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 13:32:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-03-03 13:32:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 286 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2025-03-03 13:32:13,951 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 17 [2025-03-03 13:32:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:13,951 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2025-03-03 13:32:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2025-03-03 13:32:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:32:13,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:13,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 13:32:13,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1672812399, now seen corresponding path program 1 times [2025-03-03 13:32:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974834017] [2025-03-03 13:32:13,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:13,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:32:13,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:32:13,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:13,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974834017] [2025-03-03 13:32:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974834017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116478534] [2025-03-03 13:32:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:13,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:13,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:13,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:13,986 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:14,174 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2025-03-03 13:32:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-03 13:32:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:14,175 INFO L225 Difference]: With dead ends: 287 [2025-03-03 13:32:14,175 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 13:32:14,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:14,175 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 6 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:14,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 732 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:32:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 13:32:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-03 13:32:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 282 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2025-03-03 13:32:14,180 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 17 [2025-03-03 13:32:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:14,180 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2025-03-03 13:32:14,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2025-03-03 13:32:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:32:14,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:14,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:14,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 13:32:14,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash -892024178, now seen corresponding path program 1 times [2025-03-03 13:32:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129245602] [2025-03-03 13:32:14,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:32:14,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:32:14,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129245602] [2025-03-03 13:32:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129245602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563002410] [2025-03-03 13:32:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:14,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:14,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:14,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:14,258 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:14,604 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2025-03-03 13:32:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-03 13:32:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:14,605 INFO L225 Difference]: With dead ends: 283 [2025-03-03 13:32:14,605 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 13:32:14,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:32:14,606 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 656 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:14,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 161 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 13:32:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2025-03-03 13:32:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 344 transitions. [2025-03-03 13:32:14,612 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 344 transitions. Word has length 18 [2025-03-03 13:32:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 344 transitions. [2025-03-03 13:32:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 344 transitions. [2025-03-03 13:32:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:32:14,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:14,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:14,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 13:32:14,613 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -872938044, now seen corresponding path program 1 times [2025-03-03 13:32:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801102734] [2025-03-03 13:32:14,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:14,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:32:14,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:32:14,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801102734] [2025-03-03 13:32:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801102734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489769116] [2025-03-03 13:32:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:14,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:14,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:14,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:14,674 INFO L87 Difference]: Start difference. First operand 279 states and 344 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:14,996 INFO L93 Difference]: Finished difference Result 279 states and 344 transitions. [2025-03-03 13:32:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-03 13:32:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:14,997 INFO L225 Difference]: With dead ends: 279 [2025-03-03 13:32:14,997 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 13:32:14,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:14,998 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 656 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 153 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 13:32:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-03 13:32:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 1.25) internal successors, (340), 274 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2025-03-03 13:32:15,001 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 18 [2025-03-03 13:32:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:15,001 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2025-03-03 13:32:15,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2025-03-03 13:32:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:32:15,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:15,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:15,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 13:32:15,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 334814938, now seen corresponding path program 1 times [2025-03-03 13:32:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270923842] [2025-03-03 13:32:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:15,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:32:15,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:32:15,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:15,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270923842] [2025-03-03 13:32:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270923842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713173244] [2025-03-03 13:32:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:15,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:15,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:15,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:15,070 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:15,396 INFO L93 Difference]: Finished difference Result 275 states and 340 transitions. [2025-03-03 13:32:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-03 13:32:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:15,397 INFO L225 Difference]: With dead ends: 275 [2025-03-03 13:32:15,397 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 13:32:15,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:32:15,398 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 454 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:15,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 150 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 13:32:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-03 13:32:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.0080645161290323) internal successors, (250), 249 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2025-03-03 13:32:15,401 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 18 [2025-03-03 13:32:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:15,401 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2025-03-03 13:32:15,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2025-03-03 13:32:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-03 13:32:15,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:15,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:15,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 13:32:15,404 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:15,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash 846997475, now seen corresponding path program 1 times [2025-03-03 13:32:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150644352] [2025-03-03 13:32:15,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:15,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-03 13:32:15,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-03 13:32:15,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:15,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150644352] [2025-03-03 13:32:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150644352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-03-03 13:32:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079564075] [2025-03-03 13:32:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-03 13:32:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:18,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-03 13:32:18,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 13:32:18,132 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:18,592 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2025-03-03 13:32:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-03 13:32:18,593 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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 244 [2025-03-03 13:32:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:18,594 INFO L225 Difference]: With dead ends: 250 [2025-03-03 13:32:18,594 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 13:32:18,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:32:18,595 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:18,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:32:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 13:32:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-03 13:32:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0040485829959513) internal successors, (248), 247 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2025-03-03 13:32:18,597 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2025-03-03 13:32:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:18,598 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2025-03-03 13:32:18,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2025-03-03 13:32:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 13:32:18,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:18,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:18,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 13:32:18,599 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 13:32:18,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 487118266, now seen corresponding path program 1 times [2025-03-03 13:32:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:18,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238627465] [2025-03-03 13:32:18,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:18,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 13:32:18,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 13:32:18,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:18,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238627465] [2025-03-03 13:32:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238627465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:22,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:32:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467934891] [2025-03-03 13:32:22,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:32:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:22,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:32:22,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:22,386 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:22,646 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2025-03-03 13:32:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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 245 [2025-03-03 13:32:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:22,647 INFO L225 Difference]: With dead ends: 248 [2025-03-03 13:32:22,647 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:32:22,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:32:22,648 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:22,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:32:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:32:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:32:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:32:22,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2025-03-03 13:32:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:32:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:32:22,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:32:22,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-03-03 13:32:22,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-03-03 13:32:22,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-03-03 13:32:22,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-03-03 13:32:22,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-03-03 13:32:22,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-03-03 13:32:22,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-03-03 13:32:22,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 13:32:22,657 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:22,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:32:22,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:32:22,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:32:22 BoogieIcfgContainer [2025-03-03 13:32:22,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:32:22,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:32:22,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:32:22,668 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:32:22,670 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:32:07" (3/4) ... [2025-03-03 13:32:22,671 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:32:22,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-03 13:32:22,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:32:22,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:32:22,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:32:22,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:32:22,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:32:22,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:32:22,816 INFO L158 Benchmark]: Toolchain (without parser) took 16996.23ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 120.9MB in the beginning and 691.5MB in the end (delta: -570.6MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,816 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.80ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 86.7MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.62ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 79.7MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: Boogie Preprocessor took 89.99ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 73.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: IcfgBuilder took 1200.85ms. Allocated memory is still 167.8MB. Free memory was 73.7MB in the beginning and 76.9MB in the end (delta: -3.2MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: TraceAbstraction took 15069.26ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 75.9MB in the beginning and 712.3MB in the end (delta: -636.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,817 INFO L158 Benchmark]: Witness Printer took 147.44ms. Allocated memory is still 847.2MB. Free memory was 712.3MB in the beginning and 691.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:32:22,818 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.80ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 86.7MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.62ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 79.7MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.99ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 73.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1200.85ms. Allocated memory is still 167.8MB. Free memory was 73.7MB in the beginning and 76.9MB in the end (delta: -3.2MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15069.26ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 75.9MB in the beginning and 712.3MB in the end (delta: -636.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 147.44ms. Allocated memory is still 847.2MB. Free memory was 712.3MB in the beginning and 691.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 47]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 105]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 117]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 185]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 207]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 219]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 255]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 267]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 304 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4608 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 9649 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5714 mSDsCounter, 1095 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13439 IncrementalHoareTripleChecker+Invalid, 14534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1095 mSolverCounterUnsat, 3935 mSDtfsCounter, 13439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 53 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 2473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 13:32:22,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE