./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c 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.v+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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:17:02,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:17:02,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:17:02,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:17:02,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:17:02,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:17:02,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:17:02,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:17:02,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:17:02,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:17:02,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:17:02,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:17:02,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:17:02,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:17:02,723 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:17:02,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:17:02,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:17:02,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:17:02,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:17:02,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:17:02,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:17:02,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:17:02,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:17:02,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:17:02,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:17:02,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:17:02,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:17:02,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:17:02,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:17:02,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:17:02,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:17:02,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:17:02,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:02,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:17:02,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:17:02,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:17:02,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:17:02,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:17:02,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:17:02,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:17:02,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:17:02,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:17:02,734 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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:17:03,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:17:03,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:17:03,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:17:03,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:17:03,038 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:17:03,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-10-15 14:17:04,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:17:04,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:17:04,534 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-10-15 14:17:04,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/75281683f/7130af194c7c42bda7d55f0c4f84c9c0/FLAGda5e69edc [2024-10-15 14:17:04,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/75281683f/7130af194c7c42bda7d55f0c4f84c9c0 [2024-10-15 14:17:04,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:17:04,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:17:04,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:04,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:17:04,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:17:04,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:04" (1/1) ... [2024-10-15 14:17:04,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d10227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:04, skipping insertion in model container [2024-10-15 14:17:04,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:04" (1/1) ... [2024-10-15 14:17:04,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:17:05,151 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.v+nlh-reducer.c[1123,1136] [2024-10-15 14:17:05,155 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.v+nlh-reducer.c[1338,1351] [2024-10-15 14:17:05,157 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.v+nlh-reducer.c[1654,1667] [2024-10-15 14:17:05,159 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.v+nlh-reducer.c[1869,1882] [2024-10-15 14:17:05,165 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.v+nlh-reducer.c[2402,2415] [2024-10-15 14:17:05,166 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.v+nlh-reducer.c[2617,2630] [2024-10-15 14:17:05,168 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.v+nlh-reducer.c[2919,2932] [2024-10-15 14:17:05,173 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.v+nlh-reducer.c[3134,3147] [2024-10-15 14:17:05,175 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.v+nlh-reducer.c[3404,3417] [2024-10-15 14:17:05,176 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.v+nlh-reducer.c[3622,3635] [2024-10-15 14:17:05,181 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.v+nlh-reducer.c[4106,4119] [2024-10-15 14:17:05,182 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.v+nlh-reducer.c[4324,4337] [2024-10-15 14:17:05,185 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.v+nlh-reducer.c[4820,4833] [2024-10-15 14:17:05,187 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.v+nlh-reducer.c[5221,5234] [2024-10-15 14:17:05,188 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.v+nlh-reducer.c[5439,5452] [2024-10-15 14:17:05,190 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.v+nlh-reducer.c[5881,5894] [2024-10-15 14:17:05,191 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.v+nlh-reducer.c[6099,6112] [2024-10-15 14:17:05,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:05,201 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:17:05,212 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.v+nlh-reducer.c[1123,1136] [2024-10-15 14:17:05,213 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.v+nlh-reducer.c[1338,1351] [2024-10-15 14:17:05,215 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.v+nlh-reducer.c[1654,1667] [2024-10-15 14:17:05,216 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.v+nlh-reducer.c[1869,1882] [2024-10-15 14:17:05,218 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.v+nlh-reducer.c[2402,2415] [2024-10-15 14:17:05,219 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.v+nlh-reducer.c[2617,2630] [2024-10-15 14:17:05,220 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.v+nlh-reducer.c[2919,2932] [2024-10-15 14:17:05,221 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.v+nlh-reducer.c[3134,3147] [2024-10-15 14:17:05,223 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.v+nlh-reducer.c[3404,3417] [2024-10-15 14:17:05,224 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.v+nlh-reducer.c[3622,3635] [2024-10-15 14:17:05,226 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.v+nlh-reducer.c[4106,4119] [2024-10-15 14:17:05,227 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.v+nlh-reducer.c[4324,4337] [2024-10-15 14:17:05,229 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.v+nlh-reducer.c[4820,4833] [2024-10-15 14:17:05,230 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.v+nlh-reducer.c[5221,5234] [2024-10-15 14:17:05,231 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.v+nlh-reducer.c[5439,5452] [2024-10-15 14:17:05,233 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.v+nlh-reducer.c[5881,5894] [2024-10-15 14:17:05,234 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.v+nlh-reducer.c[6099,6112] [2024-10-15 14:17:05,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:05,256 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:17:05,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05 WrapperNode [2024-10-15 14:17:05,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:05,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:05,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:17:05,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:17:05,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,274 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:17:05,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:05,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:17:05,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:17:05,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:17:05,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,303 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-10-15 14:17:05,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:17:05,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:17:05,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:17:05,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:17:05,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (1/1) ... [2024-10-15 14:17:05,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:05,353 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-10-15 14:17:05,361 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-10-15 14:17:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:17:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:17:05,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:17:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:17:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:17:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:17:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:17:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:17:05,469 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:17:05,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:17:05,716 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-10-15 14:17:05,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:17:05,741 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:17:05,742 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 14:17:05,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:05 BoogieIcfgContainer [2024-10-15 14:17:05,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:17:05,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:17:05,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:17:05,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:17:05,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:17:04" (1/3) ... [2024-10-15 14:17:05,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6f052b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:05, skipping insertion in model container [2024-10-15 14:17:05,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:05" (2/3) ... [2024-10-15 14:17:05,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6f052b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:05, skipping insertion in model container [2024-10-15 14:17:05,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:05" (3/3) ... [2024-10-15 14:17:05,752 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2024-10-15 14:17:05,768 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:17:05,768 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-15 14:17:05,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:17:05,819 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3e679fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:17:05,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-15 14:17:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 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-10-15 14:17:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:17:05,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2024-10-15 14:17:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231830050] [2024-10-15 14:17:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,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-10-15 14:17:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231830050] [2024-10-15 14:17:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231830050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423666063] [2024-10-15 14:17:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:06,276 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 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.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-10-15 14:17:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,541 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-10-15 14:17:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:06,543 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-10-15 14:17:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,551 INFO L225 Difference]: With dead ends: 91 [2024-10-15 14:17:06,551 INFO L226 Difference]: Without dead ends: 76 [2024-10-15 14:17:06,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:06,557 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:06,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-15 14:17:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2024-10-15 14:17:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 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-10-15 14:17:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-15 14:17:06,599 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2024-10-15 14:17:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-15 14:17:06,600 INFO L472 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-10-15 14:17:06,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-15 14:17:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:17:06,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:17:06,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:06,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2024-10-15 14:17:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836028260] [2024-10-15 14:17:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836028260] [2024-10-15 14:17:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836028260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989255147] [2024-10-15 14:17:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:06,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:06,759 INFO L87 Difference]: Start difference. First operand 68 states and 72 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-10-15 14:17:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,926 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-15 14:17:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:06,927 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-10-15 14:17:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,928 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:17:06,928 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:17:06,929 INFO L431 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-10-15 14:17:06,930 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:06,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 90 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:17:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-15 14:17:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 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-10-15 14:17:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-15 14:17:06,950 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2024-10-15 14:17:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,951 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-15 14:17:06,951 INFO L472 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-10-15 14:17:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-15 14:17:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-15 14:17:06,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:17:06,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2024-10-15 14:17:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101703] [2024-10-15 14:17:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101703] [2024-10-15 14:17:07,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:07,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680372402] [2024-10-15 14:17:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:07,058 INFO L87 Difference]: Start difference. First operand 66 states and 70 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-10-15 14:17:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:07,191 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-10-15 14:17:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:07,192 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-10-15 14:17:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:07,193 INFO L225 Difference]: With dead ends: 72 [2024-10-15 14:17:07,193 INFO L226 Difference]: Without dead ends: 70 [2024-10-15 14:17:07,193 INFO L431 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-10-15 14:17:07,194 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:07,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-15 14:17:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-15 14:17:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 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-10-15 14:17:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-10-15 14:17:07,206 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2024-10-15 14:17:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-10-15 14:17:07,207 INFO L472 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-10-15 14:17:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-10-15 14:17:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:07,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:07,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:17:07,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:07,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2024-10-15 14:17:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297182110] [2024-10-15 14:17:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297182110] [2024-10-15 14:17:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297182110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720038616] [2024-10-15 14:17:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:07,311 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-10-15 14:17:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:07,510 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-10-15 14:17:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:07,511 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-10-15 14:17:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:07,513 INFO L225 Difference]: With dead ends: 70 [2024-10-15 14:17:07,513 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:17:07,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:07,515 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:07,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:17:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-15 14:17:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 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-10-15 14:17:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-10-15 14:17:07,529 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2024-10-15 14:17:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-10-15 14:17:07,530 INFO L472 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-10-15 14:17:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-10-15 14:17:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:07,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:07,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:17:07,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2024-10-15 14:17:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612244655] [2024-10-15 14:17:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612244655] [2024-10-15 14:17:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612244655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:07,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:07,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621440340] [2024-10-15 14:17:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:07,650 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-10-15 14:17:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:07,807 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-15 14:17:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:07,808 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-10-15 14:17:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:07,809 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:17:07,809 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:17:07,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:07,810 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:07,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 117 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:17:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-15 14:17:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 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-10-15 14:17:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-10-15 14:17:07,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2024-10-15 14:17:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:07,821 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-10-15 14:17:07,822 INFO L472 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-10-15 14:17:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-10-15 14:17:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:07,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:07,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:17:07,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2024-10-15 14:17:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571248692] [2024-10-15 14:17:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571248692] [2024-10-15 14:17:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571248692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210012040] [2024-10-15 14:17:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:07,897 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-10-15 14:17:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,054 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-15 14:17:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-10-15 14:17:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,056 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:17:08,056 INFO L226 Difference]: Without dead ends: 64 [2024-10-15 14:17:08,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:08,057 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 111 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-15 14:17:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-15 14:17:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 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-10-15 14:17:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-10-15 14:17:08,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2024-10-15 14:17:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,066 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-10-15 14:17:08,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-10-15 14:17:08,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-10-15 14:17:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:08,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:17:08,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:08,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2024-10-15 14:17:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666553072] [2024-10-15 14:17:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666553072] [2024-10-15 14:17:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666553072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:08,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088694280] [2024-10-15 14:17:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:08,128 INFO L87 Difference]: Start difference. First operand 63 states and 67 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-10-15 14:17:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,228 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-10-15 14:17:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:08,229 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-10-15 14:17:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,230 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:17:08,230 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:17:08,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-15 14:17:08,231 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:17:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-15 14:17:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 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-10-15 14:17:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-15 14:17:08,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2024-10-15 14:17:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,240 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-15 14:17:08,241 INFO L472 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-10-15 14:17:08,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-15 14:17:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:08,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:17:08,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:08,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2024-10-15 14:17:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564506920] [2024-10-15 14:17:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564506920] [2024-10-15 14:17:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564506920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709956739] [2024-10-15 14:17:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:08,298 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-10-15 14:17:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,419 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-15 14:17:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:08,419 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-10-15 14:17:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,421 INFO L225 Difference]: With dead ends: 60 [2024-10-15 14:17:08,421 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 14:17:08,421 INFO L431 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-10-15 14:17:08,422 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 14:17:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-15 14:17:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 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-10-15 14:17:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-15 14:17:08,435 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2024-10-15 14:17:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-15 14:17:08,436 INFO L472 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-10-15 14:17:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-15 14:17:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:08,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:08,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:17:08,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2024-10-15 14:17:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435440066] [2024-10-15 14:17:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435440066] [2024-10-15 14:17:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435440066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907996505] [2024-10-15 14:17:08,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:08,552 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-10-15 14:17:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,705 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-15 14:17:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:08,705 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-10-15 14:17:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,707 INFO L225 Difference]: With dead ends: 88 [2024-10-15 14:17:08,707 INFO L226 Difference]: Without dead ends: 86 [2024-10-15 14:17:08,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:08,708 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-15 14:17:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2024-10-15 14:17:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 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-10-15 14:17:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-10-15 14:17:08,726 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2024-10-15 14:17:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-10-15 14:17:08,727 INFO L472 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-10-15 14:17:08,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-10-15 14:17:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:08,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:08,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:17:08,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2024-10-15 14:17:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98589821] [2024-10-15 14:17:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98589821] [2024-10-15 14:17:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98589821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119332998] [2024-10-15 14:17:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:08,795 INFO L87 Difference]: Start difference. First operand 60 states and 65 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-10-15 14:17:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,915 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-10-15 14:17:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:08,916 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-10-15 14:17:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,916 INFO L225 Difference]: With dead ends: 60 [2024-10-15 14:17:08,917 INFO L226 Difference]: Without dead ends: 58 [2024-10-15 14:17:08,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:08,917 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-15 14:17:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-15 14:17:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 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-10-15 14:17:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-10-15 14:17:08,926 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 16 [2024-10-15 14:17:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-10-15 14:17:08,927 INFO L472 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-10-15 14:17:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-10-15 14:17:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:08,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:08,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-15 14:17:08,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2024-10-15 14:17:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026665506] [2024-10-15 14:17:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026665506] [2024-10-15 14:17:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026665506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342748950] [2024-10-15 14:17:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:09,019 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-10-15 14:17:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,147 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-15 14:17:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:09,147 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-10-15 14:17:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,148 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:17:09,149 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 14:17:09,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:09,150 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 83 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 14:17:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-15 14:17:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 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-10-15 14:17:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-15 14:17:09,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2024-10-15 14:17:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,166 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-15 14:17:09,167 INFO L472 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-10-15 14:17:09,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-10-15 14:17:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:09,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:09,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-15 14:17:09,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2024-10-15 14:17:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011379730] [2024-10-15 14:17:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011379730] [2024-10-15 14:17:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011379730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048861515] [2024-10-15 14:17:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:09,298 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-10-15 14:17:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,447 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-10-15 14:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:17:09,448 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-10-15 14:17:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,448 INFO L225 Difference]: With dead ends: 78 [2024-10-15 14:17:09,448 INFO L226 Difference]: Without dead ends: 76 [2024-10-15 14:17:09,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:17:09,449 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:09,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 106 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-15 14:17:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2024-10-15 14:17:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 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-10-15 14:17:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-15 14:17:09,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2024-10-15 14:17:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,458 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-15 14:17:09,458 INFO L472 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-10-15 14:17:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-10-15 14:17:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:09,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:09,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:09,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:17:09,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:09,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2024-10-15 14:17:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256114287] [2024-10-15 14:17:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256114287] [2024-10-15 14:17:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256114287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727801163] [2024-10-15 14:17:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:09,518 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-10-15 14:17:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,632 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-15 14:17:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:09,632 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-10-15 14:17:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,633 INFO L225 Difference]: With dead ends: 59 [2024-10-15 14:17:09,633 INFO L226 Difference]: Without dead ends: 57 [2024-10-15 14:17:09,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:09,634 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:09,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-15 14:17:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-10-15 14:17:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 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-10-15 14:17:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-10-15 14:17:09,641 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2024-10-15 14:17:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,641 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-10-15 14:17:09,641 INFO L472 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-10-15 14:17:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-10-15 14:17:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:09,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:09,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:09,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-15 14:17:09,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:09,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,643 INFO L85 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2024-10-15 14:17:09,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:09,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054799890] [2024-10-15 14:17:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054799890] [2024-10-15 14:17:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054799890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127685693] [2024-10-15 14:17:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:09,767 INFO L87 Difference]: Start difference. First operand 54 states and 59 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-10-15 14:17:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,906 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-15 14:17:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:09,907 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-10-15 14:17:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,907 INFO L225 Difference]: With dead ends: 72 [2024-10-15 14:17:09,908 INFO L226 Difference]: Without dead ends: 70 [2024-10-15 14:17:09,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:09,908 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:09,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-15 14:17:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-10-15 14:17:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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-10-15 14:17:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-15 14:17:09,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-10-15 14:17:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-15 14:17:09,919 INFO L472 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-10-15 14:17:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-15 14:17:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:09,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:09,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-15 14:17:09,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2024-10-15 14:17:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019111428] [2024-10-15 14:17:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019111428] [2024-10-15 14:17:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019111428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:10,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413781667] [2024-10-15 14:17:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:10,021 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-10-15 14:17:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:10,166 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-15 14:17:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:10,167 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-10-15 14:17:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:10,167 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:17:10,167 INFO L226 Difference]: Without dead ends: 69 [2024-10-15 14:17:10,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:17:10,168 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:10,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 121 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-15 14:17:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-15 14:17:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 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-10-15 14:17:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-15 14:17:10,178 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2024-10-15 14:17:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:10,179 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-15 14:17:10,179 INFO L472 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-10-15 14:17:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-15 14:17:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-15 14:17:10,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:10,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-15 14:17:10,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2024-10-15 14:17:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:10,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961860819] [2024-10-15 14:17:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961860819] [2024-10-15 14:17:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961860819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:10,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:10,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:10,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301287147] [2024-10-15 14:17:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:10,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:10,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:10,287 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-10-15 14:17:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:10,437 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-15 14:17:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:10,437 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-10-15 14:17:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:10,438 INFO L225 Difference]: With dead ends: 69 [2024-10-15 14:17:10,438 INFO L226 Difference]: Without dead ends: 67 [2024-10-15 14:17:10,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:10,439 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:10,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-15 14:17:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-15 14:17:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 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-10-15 14:17:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-10-15 14:17:10,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 18 [2024-10-15 14:17:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:10,450 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-10-15 14:17:10,450 INFO L472 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-10-15 14:17:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-10-15 14:17:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:10,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:10,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:10,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-15 14:17:10,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2024-10-15 14:17:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974886284] [2024-10-15 14:17:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974886284] [2024-10-15 14:17:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974886284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600490764] [2024-10-15 14:17:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:10,520 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-10-15 14:17:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:10,607 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-15 14:17:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:10,607 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-10-15 14:17:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:10,608 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:17:10,608 INFO L226 Difference]: Without dead ends: 64 [2024-10-15 14:17:10,608 INFO L431 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-10-15 14:17:10,609 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:10,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 68 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-15 14:17:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-15 14:17:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 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-10-15 14:17:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-10-15 14:17:10,618 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 19 [2024-10-15 14:17:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-10-15 14:17:10,619 INFO L472 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-10-15 14:17:10,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-10-15 14:17:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-15 14:17:10,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:10,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-15 14:17:10,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2024-10-15 14:17:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268262951] [2024-10-15 14:17:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268262951] [2024-10-15 14:17:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268262951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897884126] [2024-10-15 14:17:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:10,691 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-10-15 14:17:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:10,768 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-10-15 14:17:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:10,769 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-10-15 14:17:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:10,769 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:17:10,769 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:17:10,770 INFO L431 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-10-15 14:17:10,770 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:10,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:17:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-15 14:17:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 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-10-15 14:17:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-10-15 14:17:10,779 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 20 [2024-10-15 14:17:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-10-15 14:17:10,779 INFO L472 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-10-15 14:17:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-10-15 14:17:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:17:10,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:10,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-15 14:17:10,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 911253964, now seen corresponding path program 1 times [2024-10-15 14:17:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909131807] [2024-10-15 14:17:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909131807] [2024-10-15 14:17:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909131807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624728294] [2024-10-15 14:17:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:10,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:17:10,897 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:17:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:10,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:17:10,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:11,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 14:17:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624728294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:11,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-10-15 14:17:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176252854] [2024-10-15 14:17:11,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:11,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:17:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:17:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:17:11,312 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:11,599 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-15 14:17:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:17:11,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-15 14:17:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:11,600 INFO L225 Difference]: With dead ends: 86 [2024-10-15 14:17:11,600 INFO L226 Difference]: Without dead ends: 84 [2024-10-15 14:17:11,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:17:11,601 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 407 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:11,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 113 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-15 14:17:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2024-10-15 14:17:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 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-10-15 14:17:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-10-15 14:17:11,612 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2024-10-15 14:17:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:11,612 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-10-15 14:17:11,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-10-15 14:17:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:17:11,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:11,613 INFO L215 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-10-15 14:17:11,632 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:17:11,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:11,814 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:11,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1524331500, now seen corresponding path program 1 times [2024-10-15 14:17:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124412655] [2024-10-15 14:17:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:11,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124412655] [2024-10-15 14:17:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124412655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:11,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337411002] [2024-10-15 14:17:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:11,908 INFO L87 Difference]: Start difference. First operand 56 states and 63 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-10-15 14:17:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:12,036 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-15 14:17:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:12,036 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-10-15 14:17:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:12,037 INFO L225 Difference]: With dead ends: 56 [2024-10-15 14:17:12,037 INFO L226 Difference]: Without dead ends: 54 [2024-10-15 14:17:12,038 INFO L431 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-10-15 14:17:12,038 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:12,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 46 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-15 14:17:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-10-15 14:17:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 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-10-15 14:17:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-10-15 14:17:12,056 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 21 [2024-10-15 14:17:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:12,056 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-10-15 14:17:12,056 INFO L472 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-10-15 14:17:12,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-10-15 14:17:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:17:12,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:12,057 INFO L215 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] [2024-10-15 14:17:12,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-15 14:17:12,057 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:12,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -682220907, now seen corresponding path program 1 times [2024-10-15 14:17:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266354298] [2024-10-15 14:17:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266354298] [2024-10-15 14:17:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266354298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402029031] [2024-10-15 14:17:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:12,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:12,157 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-15 14:17:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:12,268 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-15 14:17:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2024-10-15 14:17:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:12,268 INFO L225 Difference]: With dead ends: 51 [2024-10-15 14:17:12,268 INFO L226 Difference]: Without dead ends: 49 [2024-10-15 14:17:12,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-10-15 14:17:12,269 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:12,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-15 14:17:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-15 14:17:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 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-10-15 14:17:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-15 14:17:12,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2024-10-15 14:17:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-15 14:17:12,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-15 14:17:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-15 14:17:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:17:12,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:12,279 INFO L215 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] [2024-10-15 14:17:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-15 14:17:12,279 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:12,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -634505657, now seen corresponding path program 1 times [2024-10-15 14:17:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956016852] [2024-10-15 14:17:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:12,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956016852] [2024-10-15 14:17:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956016852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:12,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:12,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071781458] [2024-10-15 14:17:12,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:12,376 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-15 14:17:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:12,472 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-15 14:17:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2024-10-15 14:17:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:12,473 INFO L225 Difference]: With dead ends: 46 [2024-10-15 14:17:12,473 INFO L226 Difference]: Without dead ends: 23 [2024-10-15 14:17:12,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-10-15 14:17:12,474 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:12,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-15 14:17:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-15 14:17:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-10-15 14:17:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-15 14:17:12,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2024-10-15 14:17:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-15 14:17:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-15 14:17:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-15 14:17:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:17:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:12,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-15 14:17:12,482 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-15 14:17:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1822144134, now seen corresponding path program 1 times [2024-10-15 14:17:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431023088] [2024-10-15 14:17:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431023088] [2024-10-15 14:17:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431023088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053545713] [2024-10-15 14:17:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:12,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:12,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:17:12,594 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:17:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:17:12,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:12,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 14:17:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053545713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:12,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-10-15 14:17:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005296483] [2024-10-15 14:17:12,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:17:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:17:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:17:12,901 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:13,022 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-15 14:17:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:17:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-15 14:17:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:13,023 INFO L225 Difference]: With dead ends: 34 [2024-10-15 14:17:13,023 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:17:13,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:17:13,024 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:13,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:17:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:17:13,024 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-10-15 14:17:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:17:13,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-10-15 14:17:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:13,025 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:17:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:17:13,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:17:13,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2024-10-15 14:17:13,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2024-10-15 14:17:13,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2024-10-15 14:17:13,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2024-10-15 14:17:13,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2024-10-15 14:17:13,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2024-10-15 14:17:13,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2024-10-15 14:17:13,048 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:17:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-15 14:17:13,235 INFO L407 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, 1, 1] [2024-10-15 14:17:13,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:17:15,006 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:17:15,023 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) Eliminated clause: true [2024-10-15 14:17:15,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:17:15 BoogieIcfgContainer [2024-10-15 14:17:15,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:17:15,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:17:15,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:17:15,031 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:17:15,031 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:05" (3/4) ... [2024-10-15 14:17:15,033 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:17:15,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:17:15,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:17:15,088 INFO L158 Benchmark]: Toolchain (without parser) took 10158.48ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 133.7MB in the beginning and 186.7MB in the end (delta: -52.9MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.06ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 114.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.51ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 113.9MB in the end (delta: 528.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: RCFGBuilder took 422.86ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 92.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,089 INFO L158 Benchmark]: TraceAbstraction took 9285.83ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 91.4MB in the beginning and 189.8MB in the end (delta: -98.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,090 INFO L158 Benchmark]: Witness Printer took 53.73ms. Allocated memory is still 293.6MB. Free memory was 189.8MB in the beginning and 186.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 14:17:15,091 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.18ms. Allocated memory is still 115.3MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.06ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 114.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.51ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 113.9MB in the end (delta: 528.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 422.86ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 92.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9285.83ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 91.4MB in the beginning and 189.8MB in the end (delta: -98.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 53.73ms. Allocated memory is still 293.6MB. Free memory was 189.8MB in the beginning and 186.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: 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: 56]: 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: 73]: 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: 85]: 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: 115]: 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: 127]: 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: 143]: 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: 155]: 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: 177]: 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: 189]: 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: 225]: 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: 237]: 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: 279]: 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: 298]: 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: 310]: 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: 339]: 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: 351]: 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, 75 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 2244 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 698 mSDtfsCounter, 2988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 112 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1890 SizeOfPredicates, 6 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 64]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 283]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || ((main__t == 0) && (1 <= main__tagbuf_len))) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || (((main__tagbuf_len != main__t) && (main__t == 0)) && (main__t <= main__tagbuf_len))) - InvariantResult [Line: 102]: Location Invariant Derived location invariant: (((main__tagbuf_len != main__t) && (1 <= main__t)) && (main__t <= main__tagbuf_len)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:17:15,122 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