./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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:22:20,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:22:20,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:22:20,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:22:20,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:22:20,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:22:20,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:22:20,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:22:20,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:22:20,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:22:20,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:22:20,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:22:20,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:22:20,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:22:20,221 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:22:20,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:22:20,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:22:20,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:22:20,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:22:20,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:22:20,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:22:20,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:22:20,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:22:20,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:22:20,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:22:20,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:22:20,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:22:20,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:22:20,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:22:20,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:22:20,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:22:20,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:22:20,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:20,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:22:20,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:22:20,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:22:20,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:22:20,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:22:20,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:22:20,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:22:20,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:22:20,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:22:20,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/certificate-witnesses-artifact/automizer 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:22:20,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:22:20,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:22:20,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:22:20,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:22:20,608 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:22:20,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-25 10:22:22,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:22:22,335 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:22:22,335 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-25 10:22:22,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/17743eb11/5edebab1179f46bf964ca91db147d6d9/FLAG5bbecf1f4 [2024-09-25 10:22:22,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/17743eb11/5edebab1179f46bf964ca91db147d6d9 [2024-09-25 10:22:22,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:22:22,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:22:22,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:22,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:22:22,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:22:22,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:22" (1/1) ... [2024-09-25 10:22:22,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ea4b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:22, skipping insertion in model container [2024-09-25 10:22:22,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:22" (1/1) ... [2024-09-25 10:22:22,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:22:22,653 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-09-25 10:22:22,659 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-09-25 10:22:22,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-09-25 10:22:22,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-09-25 10:22:22,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-09-25 10:22:22,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-09-25 10:22:22,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-09-25 10:22:22,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-09-25 10:22:22,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-09-25 10:22:22,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-09-25 10:22:22,693 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-09-25 10:22:22,694 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-09-25 10:22:22,696 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-09-25 10:22:22,697 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-09-25 10:22:22,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-09-25 10:22:22,933 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-09-25 10:22:22,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:22,971 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:22:22,984 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-09-25 10:22:22,987 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-09-25 10:22:22,992 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-09-25 10:22:22,993 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-09-25 10:22:22,993 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-09-25 10:22:22,994 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-09-25 10:22:22,995 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-09-25 10:22:22,997 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-09-25 10:22:23,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-09-25 10:22:23,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-09-25 10:22:23,006 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-09-25 10:22:23,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-09-25 10:22:23,008 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-09-25 10:22:23,009 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-09-25 10:22:23,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-09-25 10:22:23,169 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-09-25 10:22:23,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:23,199 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:22:23,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23 WrapperNode [2024-09-25 10:22:23,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:23,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:23,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:22:23,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:22:23,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,254 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:22:23,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:23,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:22:23,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:22:23,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:22:23,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,314 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]. [2024-09-25 10:22:23,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:22:23,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:22:23,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:22:23,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:22:23,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (1/1) ... [2024-09-25 10:22:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:23,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:22:23,421 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:22:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:22:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:22:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:22:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:22:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:22:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:22:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:22:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:22:23,648 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:22:23,651 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:22:24,682 INFO L? ?]: Removed 606 outVars from TransFormulas that were not future-live. [2024-09-25 10:22:24,682 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:22:24,719 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:22:24,720 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 10:22:24,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:24 BoogieIcfgContainer [2024-09-25 10:22:24,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:22:24,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:22:24,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:22:24,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:22:24,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:22:22" (1/3) ... [2024-09-25 10:22:24,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2b4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:24, skipping insertion in model container [2024-09-25 10:22:24,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:23" (2/3) ... [2024-09-25 10:22:24,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2b4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:24, skipping insertion in model container [2024-09-25 10:22:24,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:24" (3/3) ... [2024-09-25 10:22:24,732 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2024-09-25 10:22:24,750 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:22:24,750 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-25 10:22:24,833 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:22:24,842 INFO L336 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=All, 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;@25d00cfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:22:24,843 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-25 10:22:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:22:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:22:24,856 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:24,857 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:24,857 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:24,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1962000724, now seen corresponding path program 1 times [2024-09-25 10:22:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852074751] [2024-09-25 10:22:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:25,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852074751] [2024-09-25 10:22:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852074751] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360643981] [2024-09-25 10:22:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:25,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:25,246 INFO L87 Difference]: Start difference. First operand has 308 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:26,588 INFO L93 Difference]: Finished difference Result 320 states and 582 transitions. [2024-09-25 10:22:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:22:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:26,603 INFO L225 Difference]: With dead ends: 320 [2024-09-25 10:22:26,603 INFO L226 Difference]: Without dead ends: 306 [2024-09-25 10:22:26,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:26,612 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 886 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:26,614 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 105 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-25 10:22:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-25 10:22:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2024-09-25 10:22:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 283 states have (on average 1.4876325088339222) internal successors, (421), 297 states have internal predecessors, (421), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2024-09-25 10:22:26,750 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 10 [2024-09-25 10:22:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:26,750 INFO L474 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2024-09-25 10:22:26,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:26,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2024-09-25 10:22:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:22:26,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:26,754 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:26,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:22:26,754 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:26,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -692477239, now seen corresponding path program 1 times [2024-09-25 10:22:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685197646] [2024-09-25 10:22:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:26,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685197646] [2024-09-25 10:22:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685197646] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794671790] [2024-09-25 10:22:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:26,889 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:26,890 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,926 INFO L93 Difference]: Finished difference Result 311 states and 434 transitions. [2024-09-25 10:22:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:27,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:22:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,929 INFO L225 Difference]: With dead ends: 311 [2024-09-25 10:22:27,929 INFO L226 Difference]: Without dead ends: 303 [2024-09-25 10:22:27,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:27,931 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 315 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,931 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 175 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-25 10:22:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-09-25 10:22:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-09-25 10:22:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 292 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2024-09-25 10:22:27,981 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 11 [2024-09-25 10:22:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,981 INFO L474 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2024-09-25 10:22:27,982 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2024-09-25 10:22:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:22:27,984 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,984 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:22:27,985 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:27,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -676227242, now seen corresponding path program 1 times [2024-09-25 10:22:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727966521] [2024-09-25 10:22:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727966521] [2024-09-25 10:22:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727966521] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503948317] [2024-09-25 10:22:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,103 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:28,107 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,759 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2024-09-25 10:22:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:22:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,762 INFO L225 Difference]: With dead ends: 296 [2024-09-25 10:22:28,763 INFO L226 Difference]: Without dead ends: 294 [2024-09-25 10:22:28,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:28,764 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 516 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,766 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 80 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-09-25 10:22:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-09-25 10:22:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 290 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2024-09-25 10:22:28,832 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 11 [2024-09-25 10:22:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,832 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2024-09-25 10:22:28,833 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2024-09-25 10:22:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:22:28,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,835 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,836 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:22:28,836 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:28,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 511795059, now seen corresponding path program 1 times [2024-09-25 10:22:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357928967] [2024-09-25 10:22:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357928967] [2024-09-25 10:22:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357928967] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25057223] [2024-09-25 10:22:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:28,940 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:29,647 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2024-09-25 10:22:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:22:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:29,649 INFO L225 Difference]: With dead ends: 299 [2024-09-25 10:22:29,649 INFO L226 Difference]: Without dead ends: 297 [2024-09-25 10:22:29,650 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:29,650 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:29,651 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 141 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-25 10:22:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-25 10:22:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 293 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2024-09-25 10:22:29,681 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2024-09-25 10:22:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:29,681 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2024-09-25 10:22:29,682 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2024-09-25 10:22:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:22:29,683 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:29,683 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:29,683 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:22:29,683 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:29,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2086090537, now seen corresponding path program 1 times [2024-09-25 10:22:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311219608] [2024-09-25 10:22:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311219608] [2024-09-25 10:22:29,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311219608] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24483518] [2024-09-25 10:22:29,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,764 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:29,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:29,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:29,765 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:30,437 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2024-09-25 10:22:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-25 10:22:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:30,439 INFO L225 Difference]: With dead ends: 297 [2024-09-25 10:22:30,439 INFO L226 Difference]: Without dead ends: 295 [2024-09-25 10:22:30,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:30,440 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 514 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:30,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 109 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-25 10:22:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-25 10:22:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2024-09-25 10:22:30,486 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 14 [2024-09-25 10:22:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:30,486 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2024-09-25 10:22:30,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2024-09-25 10:22:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:22:30,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:30,488 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:30,488 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:22:30,488 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:30,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash -244294110, now seen corresponding path program 1 times [2024-09-25 10:22:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431200848] [2024-09-25 10:22:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431200848] [2024-09-25 10:22:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431200848] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845296615] [2024-09-25 10:22:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:30,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:30,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:30,563 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:31,270 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2024-09-25 10:22:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:22:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:31,272 INFO L225 Difference]: With dead ends: 295 [2024-09-25 10:22:31,272 INFO L226 Difference]: Without dead ends: 291 [2024-09-25 10:22:31,273 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:31,273 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 247 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:31,274 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 124 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-09-25 10:22:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-09-25 10:22:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2024-09-25 10:22:31,319 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 15 [2024-09-25 10:22:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:31,319 INFO L474 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2024-09-25 10:22:31,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2024-09-25 10:22:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:31,321 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:31,321 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:31,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:22:31,321 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:31,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1367121598, now seen corresponding path program 1 times [2024-09-25 10:22:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55782291] [2024-09-25 10:22:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:31,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55782291] [2024-09-25 10:22:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55782291] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155093640] [2024-09-25 10:22:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:31,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:31,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:31,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:31,455 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:32,342 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2024-09-25 10:22:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:22:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:32,344 INFO L225 Difference]: With dead ends: 316 [2024-09-25 10:22:32,344 INFO L226 Difference]: Without dead ends: 314 [2024-09-25 10:22:32,345 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:22:32,345 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 265 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:32,346 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 169 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-25 10:22:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-25 10:22:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 291. [2024-09-25 10:22:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2024-09-25 10:22:32,378 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 16 [2024-09-25 10:22:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:32,378 INFO L474 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2024-09-25 10:22:32,378 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2024-09-25 10:22:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:32,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:32,380 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:32,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:22:32,380 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:32,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1030085224, now seen corresponding path program 1 times [2024-09-25 10:22:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:32,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569189699] [2024-09-25 10:22:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569189699] [2024-09-25 10:22:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569189699] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:32,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:32,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99668466] [2024-09-25 10:22:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:32,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:32,485 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:33,087 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2024-09-25 10:22:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:33,089 INFO L225 Difference]: With dead ends: 294 [2024-09-25 10:22:33,089 INFO L226 Difference]: Without dead ends: 292 [2024-09-25 10:22:33,090 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:33,090 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 509 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:33,090 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 95 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-25 10:22:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-09-25 10:22:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 285 states have internal predecessors, (349), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 352 transitions. [2024-09-25 10:22:33,142 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 352 transitions. Word has length 16 [2024-09-25 10:22:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:33,142 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 352 transitions. [2024-09-25 10:22:33,142 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 352 transitions. [2024-09-25 10:22:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:33,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:33,144 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:33,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:22:33,144 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:33,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1031624424, now seen corresponding path program 1 times [2024-09-25 10:22:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324991261] [2024-09-25 10:22:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:33,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324991261] [2024-09-25 10:22:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324991261] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366300255] [2024-09-25 10:22:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:33,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:33,203 INFO L87 Difference]: Start difference. First operand 289 states and 352 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:33,766 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2024-09-25 10:22:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:33,768 INFO L225 Difference]: With dead ends: 292 [2024-09-25 10:22:33,768 INFO L226 Difference]: Without dead ends: 290 [2024-09-25 10:22:33,769 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:33,769 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 507 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:33,770 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 89 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-25 10:22:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-09-25 10:22:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 283 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2024-09-25 10:22:33,810 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 16 [2024-09-25 10:22:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:33,810 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2024-09-25 10:22:33,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:33,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2024-09-25 10:22:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:33,811 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:33,812 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:33,812 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-25 10:22:33,812 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:33,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1869239409, now seen corresponding path program 1 times [2024-09-25 10:22:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963686946] [2024-09-25 10:22:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:33,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963686946] [2024-09-25 10:22:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963686946] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911318292] [2024-09-25 10:22:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:33,883 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:33,884 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:34,472 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2024-09-25 10:22:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:34,474 INFO L225 Difference]: With dead ends: 290 [2024-09-25 10:22:34,474 INFO L226 Difference]: Without dead ends: 288 [2024-09-25 10:22:34,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:34,475 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 504 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:34,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 83 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-25 10:22:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-09-25 10:22:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 274 states have (on average 1.2591240875912408) internal successors, (345), 281 states have internal predecessors, (345), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2024-09-25 10:22:34,505 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2024-09-25 10:22:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:34,505 INFO L474 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2024-09-25 10:22:34,505 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:34,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2024-09-25 10:22:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:34,506 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:34,506 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:34,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-25 10:22:34,507 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:34,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1867873989, now seen corresponding path program 1 times [2024-09-25 10:22:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784265624] [2024-09-25 10:22:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:34,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784265624] [2024-09-25 10:22:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784265624] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:34,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:34,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652096330] [2024-09-25 10:22:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:34,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:34,637 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:35,438 INFO L93 Difference]: Finished difference Result 302 states and 368 transitions. [2024-09-25 10:22:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:22:35,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:35,440 INFO L225 Difference]: With dead ends: 302 [2024-09-25 10:22:35,440 INFO L226 Difference]: Without dead ends: 300 [2024-09-25 10:22:35,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:35,441 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 256 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:35,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 139 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:22:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-25 10:22:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2024-09-25 10:22:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2024-09-25 10:22:35,472 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 17 [2024-09-25 10:22:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:35,472 INFO L474 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2024-09-25 10:22:35,473 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:35,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2024-09-25 10:22:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:35,474 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:35,474 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:35,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-25 10:22:35,474 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:35,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1915589239, now seen corresponding path program 1 times [2024-09-25 10:22:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:35,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80707348] [2024-09-25 10:22:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:35,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:35,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80707348] [2024-09-25 10:22:35,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80707348] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:35,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863039913] [2024-09-25 10:22:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:35,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:35,610 INFO L87 Difference]: Start difference. First operand 293 states and 358 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:36,347 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2024-09-25 10:22:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:22:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:36,349 INFO L225 Difference]: With dead ends: 303 [2024-09-25 10:22:36,349 INFO L226 Difference]: Without dead ends: 299 [2024-09-25 10:22:36,349 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:36,350 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 256 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:36,350 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 139 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-25 10:22:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2024-09-25 10:22:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2024-09-25 10:22:36,381 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 17 [2024-09-25 10:22:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:36,381 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2024-09-25 10:22:36,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:36,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2024-09-25 10:22:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:22:36,382 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:36,382 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:36,383 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 10:22:36,383 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2111849979, now seen corresponding path program 1 times [2024-09-25 10:22:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179624855] [2024-09-25 10:22:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:36,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179624855] [2024-09-25 10:22:36,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179624855] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:36,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:36,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234690531] [2024-09-25 10:22:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:36,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:36,515 INFO L87 Difference]: Start difference. First operand 294 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:37,162 INFO L93 Difference]: Finished difference Result 299 states and 364 transitions. [2024-09-25 10:22:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:22:37,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-25 10:22:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:37,164 INFO L225 Difference]: With dead ends: 299 [2024-09-25 10:22:37,164 INFO L226 Difference]: Without dead ends: 297 [2024-09-25 10:22:37,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:37,165 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 256 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:37,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 118 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:22:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-25 10:22:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-25 10:22:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.2552447552447552) internal successors, (359), 293 states have internal predecessors, (359), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 362 transitions. [2024-09-25 10:22:37,193 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 362 transitions. Word has length 18 [2024-09-25 10:22:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:37,193 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 362 transitions. [2024-09-25 10:22:37,194 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 362 transitions. [2024-09-25 10:22:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:22:37,195 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:37,195 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:37,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-25 10:22:37,195 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:37,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -269329336, now seen corresponding path program 1 times [2024-09-25 10:22:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533578021] [2024-09-25 10:22:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:37,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:37,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533578021] [2024-09-25 10:22:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533578021] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415661845] [2024-09-25 10:22:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:37,254 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:37,254 INFO L87 Difference]: Start difference. First operand 297 states and 362 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:37,696 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2024-09-25 10:22:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:22:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:37,698 INFO L225 Difference]: With dead ends: 297 [2024-09-25 10:22:37,698 INFO L226 Difference]: Without dead ends: 295 [2024-09-25 10:22:37,698 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:37,698 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 560 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:37,699 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 72 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:22:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-25 10:22:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-25 10:22:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 285 states have (on average 1.2526315789473683) internal successors, (357), 291 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2024-09-25 10:22:37,729 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 19 [2024-09-25 10:22:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:37,730 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2024-09-25 10:22:37,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:37,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2024-09-25 10:22:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:22:37,731 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:37,731 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:37,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-25 10:22:37,731 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:37,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1720197717, now seen corresponding path program 1 times [2024-09-25 10:22:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006877918] [2024-09-25 10:22:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:37,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:37,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006877918] [2024-09-25 10:22:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006877918] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496371038] [2024-09-25 10:22:37,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:37,824 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:37,825 INFO L87 Difference]: Start difference. First operand 295 states and 360 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:38,337 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2024-09-25 10:22:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:22:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:38,339 INFO L225 Difference]: With dead ends: 295 [2024-09-25 10:22:38,339 INFO L226 Difference]: Without dead ends: 293 [2024-09-25 10:22:38,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:38,340 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 903 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:38,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 57 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:22:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-25 10:22:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-09-25 10:22:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 286 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2024-09-25 10:22:38,378 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 20 [2024-09-25 10:22:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:38,379 INFO L474 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2024-09-25 10:22:38,379 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:38,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2024-09-25 10:22:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:22:38,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:38,380 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:38,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-25 10:22:38,380 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:38,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash 240728308, now seen corresponding path program 1 times [2024-09-25 10:22:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:38,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573199647] [2024-09-25 10:22:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:38,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573199647] [2024-09-25 10:22:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573199647] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:38,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971772136] [2024-09-25 10:22:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:38,448 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:38,449 INFO L87 Difference]: Start difference. First operand 290 states and 355 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:38,983 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2024-09-25 10:22:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:22:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:38,985 INFO L225 Difference]: With dead ends: 290 [2024-09-25 10:22:38,985 INFO L226 Difference]: Without dead ends: 286 [2024-09-25 10:22:38,985 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:38,986 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 245 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:38,986 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 88 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-09-25 10:22:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-09-25 10:22:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 282 states have internal predecessors, (348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 351 transitions. [2024-09-25 10:22:39,014 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 351 transitions. Word has length 20 [2024-09-25 10:22:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:39,014 INFO L474 AbstractCegarLoop]: Abstraction has 286 states and 351 transitions. [2024-09-25 10:22:39,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:39,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 351 transitions. [2024-09-25 10:22:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:39,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:39,015 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:39,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-25 10:22:39,015 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:39,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1498986922, now seen corresponding path program 1 times [2024-09-25 10:22:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208224900] [2024-09-25 10:22:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208224900] [2024-09-25 10:22:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208224900] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:39,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:39,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807833303] [2024-09-25 10:22:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:39,118 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:39,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:39,119 INFO L87 Difference]: Start difference. First operand 286 states and 351 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:39,643 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2024-09-25 10:22:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:39,645 INFO L225 Difference]: With dead ends: 286 [2024-09-25 10:22:39,645 INFO L226 Difference]: Without dead ends: 284 [2024-09-25 10:22:39,646 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:39,646 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 895 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:39,647 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 45 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:22:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-25 10:22:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-09-25 10:22:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2024-09-25 10:22:39,687 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 21 [2024-09-25 10:22:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:39,688 INFO L474 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2024-09-25 10:22:39,688 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:39,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2024-09-25 10:22:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:39,689 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:39,689 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:39,689 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-25 10:22:39,689 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:39,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1451271672, now seen corresponding path program 1 times [2024-09-25 10:22:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045667834] [2024-09-25 10:22:39,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045667834] [2024-09-25 10:22:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045667834] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174861445] [2024-09-25 10:22:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:39,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:39,807 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:40,339 INFO L93 Difference]: Finished difference Result 282 states and 347 transitions. [2024-09-25 10:22:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:40,341 INFO L225 Difference]: With dead ends: 282 [2024-09-25 10:22:40,341 INFO L226 Difference]: Without dead ends: 278 [2024-09-25 10:22:40,341 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:40,341 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 698 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:40,342 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 40 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-25 10:22:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-09-25 10:22:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 272 states have (on average 1.25) internal successors, (340), 274 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2024-09-25 10:22:40,377 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 21 [2024-09-25 10:22:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:40,378 INFO L474 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2024-09-25 10:22:40,378 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:40,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2024-09-25 10:22:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:40,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:40,379 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:40,379 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-25 10:22:40,379 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:40,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1114116772, now seen corresponding path program 1 times [2024-09-25 10:22:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650757730] [2024-09-25 10:22:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650757730] [2024-09-25 10:22:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650757730] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:40,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565455905] [2024-09-25 10:22:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:40,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:40,491 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:41,084 INFO L93 Difference]: Finished difference Result 278 states and 343 transitions. [2024-09-25 10:22:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:41,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:41,086 INFO L225 Difference]: With dead ends: 278 [2024-09-25 10:22:41,086 INFO L226 Difference]: Without dead ends: 253 [2024-09-25 10:22:41,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:41,087 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 693 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:41,087 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 36 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:22:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-09-25 10:22:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-09-25 10:22:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.0080645161290323) internal successors, (250), 249 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2024-09-25 10:22:41,120 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 21 [2024-09-25 10:22:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:41,120 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2024-09-25 10:22:41,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:41,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2024-09-25 10:22:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-25 10:22:41,127 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:41,128 INFO L216 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, 1, 1] [2024-09-25 10:22:41,128 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-25 10:22:41,128 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:41,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash 25963049, now seen corresponding path program 1 times [2024-09-25 10:22:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402386200] [2024-09-25 10:22:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:45,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402386200] [2024-09-25 10:22:45,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402386200] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:45,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:45,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2024-09-25 10:22:45,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464418440] [2024-09-25 10:22:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:45,243 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-09-25 10:22:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:45,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-09-25 10:22:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2024-09-25 10:22:45,247 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:47,393 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2024-09-25 10:22:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-25 10:22:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 247 [2024-09-25 10:22:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:47,395 INFO L225 Difference]: With dead ends: 253 [2024-09-25 10:22:47,395 INFO L226 Difference]: Without dead ends: 251 [2024-09-25 10:22:47,399 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2024-09-25 10:22:47,399 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 257 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:47,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 37 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:22:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-09-25 10:22:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-09-25 10:22:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 247 states have (on average 1.0040485829959513) internal successors, (248), 247 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2024-09-25 10:22:47,437 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2024-09-25 10:22:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:47,438 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2024-09-25 10:22:47,438 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:47,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2024-09-25 10:22:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-25 10:22:47,441 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:47,441 INFO L216 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, 1, 1, 1] [2024-09-25 10:22:47,441 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-25 10:22:47,441 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-25 10:22:47,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 804858766, now seen corresponding path program 1 times [2024-09-25 10:22:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629849107] [2024-09-25 10:22:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:53,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629849107] [2024-09-25 10:22:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629849107] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:53,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 10:22:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097175126] [2024-09-25 10:22:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:53,613 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:22:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:22:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:53,614 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:54,073 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2024-09-25 10:22:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:54,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 248 [2024-09-25 10:22:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:54,075 INFO L225 Difference]: With dead ends: 251 [2024-09-25 10:22:54,075 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:22:54,076 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:54,076 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 247 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:54,077 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 18 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:22:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:22:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:22:54,078 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) [2024-09-25 10:22:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:22:54,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2024-09-25 10:22:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:54,079 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:22:54,079 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:54,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:22:54,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:22:54,082 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-25 10:22:54,082 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-25 10:22:54,083 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-25 10:22:54,083 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-25 10:22:54,083 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-25 10:22:54,083 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-25 10:22:54,083 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-25 10:22:54,084 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-25 10:22:54,085 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-25 10:22:54,085 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-25 10:22:54,085 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-25 10:22:54,085 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-25 10:22:54,088 INFO L408 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] [2024-09-25 10:22:54,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:22:57,826 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:22:57,844 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) Eliminated clause: true [2024-09-25 10:22:57,846 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:57,847 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:57,847 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:57,848 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:57,848 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:57,848 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:57,848 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:57,848 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:57,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:22:57 BoogieIcfgContainer [2024-09-25 10:22:57,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:22:57,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:22:57,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:22:57,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:22:57,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:24" (3/4) ... [2024-09-25 10:22:57,852 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:22:57,911 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:22:57,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:22:57,912 INFO L158 Benchmark]: Toolchain (without parser) took 35521.93ms. Allocated memory was 65.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,912 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 41.9MB. Free memory was 25.1MB in the beginning and 25.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:22:57,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.65ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.9MB in the beginning and 51.5MB in the end (delta: -8.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.72ms. Allocated memory is still 86.0MB. Free memory was 51.5MB in the beginning and 49.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,914 INFO L158 Benchmark]: Boogie Preprocessor took 114.83ms. Allocated memory is still 86.0MB. Free memory was 49.8MB in the beginning and 42.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,915 INFO L158 Benchmark]: RCFGBuilder took 1349.62ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 42.8MB in the beginning and 52.7MB in the end (delta: -9.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,915 INFO L158 Benchmark]: TraceAbstraction took 33125.56ms. Allocated memory was 104.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 52.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 459.3MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,915 INFO L158 Benchmark]: Witness Printer took 61.06ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:57,916 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.17ms. Allocated memory is still 41.9MB. Free memory was 25.1MB in the beginning and 25.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.65ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.9MB in the beginning and 51.5MB in the end (delta: -8.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.72ms. Allocated memory is still 86.0MB. Free memory was 51.5MB in the beginning and 49.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.83ms. Allocated memory is still 86.0MB. Free memory was 49.8MB in the beginning and 42.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1349.62ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 42.8MB in the beginning and 52.7MB in the end (delta: -9.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33125.56ms. Allocated memory was 104.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 52.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 459.3MB. Max. memory is 16.1GB. * Witness Printer took 61.06ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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 3 procedures, 308 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9771 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9771 mSDsluCounter, 1959 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1334 mSDsCounter, 1107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23665 IncrementalHoareTripleChecker+Invalid, 24772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1107 mSolverCounterUnsat, 625 mSDtfsCounter, 23665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 61 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 2771 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((0 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 96]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 2591]: Location Invariant Derived location invariant: ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 21]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:22:57,954 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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