./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/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+lhb-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 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 18:42:03,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 18:42:03,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 18:42:03,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 18:42:03,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 18:42:03,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 18:42:03,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 18:42:03,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 18:42:03,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 18:42:03,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 18:42:03,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 18:42:03,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 18:42:03,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 18:42:03,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 18:42:03,225 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 18:42:03,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 18:42:03,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 18:42:03,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 18:42:03,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 18:42:03,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 18:42:03,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 18:42:03,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 18:42:03,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 18:42:03,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 18:42:03,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 18:42:03,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 18:42:03,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 18:42:03,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:42:03,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 18:42:03,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 18:42:03,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 18:42:03,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 18:42:03,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 18:42:03,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 18:42:03,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 18:42:03,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 18:42:03,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 18:42:03,233 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 -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 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 [2024-09-15 18:42:03,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 18:42:03,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 18:42:03,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 18:42:03,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 18:42:03,532 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 18:42:03,533 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+lhb-reducer.c [2024-09-15 18:42:04,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 18:42:05,025 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 18:42:05,026 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-15 18:42:05,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e6cea6737/a1a4b1cd88914b9797f163029cd71ff6/FLAGfc58505ed [2024-09-15 18:42:05,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e6cea6737/a1a4b1cd88914b9797f163029cd71ff6 [2024-09-15 18:42:05,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 18:42:05,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 18:42:05,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 18:42:05,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 18:42:05,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 18:42:05,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a248e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05, skipping insertion in model container [2024-09-15 18:42:05,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 18:42:05,238 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+lhb-reducer.c[1224,1237] [2024-09-15 18:42:05,244 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+lhb-reducer.c[1636,1649] [2024-09-15 18:42:05,247 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+lhb-reducer.c[1851,1864] [2024-09-15 18:42:05,250 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+lhb-reducer.c[2384,2397] [2024-09-15 18:42:05,253 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+lhb-reducer.c[2599,2612] [2024-09-15 18:42:05,255 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+lhb-reducer.c[2901,2914] [2024-09-15 18:42:05,260 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+lhb-reducer.c[3116,3129] [2024-09-15 18:42:05,261 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+lhb-reducer.c[3386,3399] [2024-09-15 18:42:05,263 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+lhb-reducer.c[3604,3617] [2024-09-15 18:42:05,265 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+lhb-reducer.c[4088,4101] [2024-09-15 18:42:05,267 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+lhb-reducer.c[4306,4319] [2024-09-15 18:42:05,269 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+lhb-reducer.c[4802,4815] [2024-09-15 18:42:05,271 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+lhb-reducer.c[5203,5216] [2024-09-15 18:42:05,273 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+lhb-reducer.c[5421,5434] [2024-09-15 18:42:05,277 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+lhb-reducer.c[5792,5805] [2024-09-15 18:42:05,277 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+lhb-reducer.c[6010,6023] [2024-09-15 18:42:05,278 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+lhb-reducer.c[6296,6309] [2024-09-15 18:42:05,279 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+lhb-reducer.c[6514,6527] [2024-09-15 18:42:05,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:42:05,294 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 18:42:05,307 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+lhb-reducer.c[1224,1237] [2024-09-15 18:42:05,308 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+lhb-reducer.c[1636,1649] [2024-09-15 18:42:05,309 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+lhb-reducer.c[1851,1864] [2024-09-15 18:42:05,315 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+lhb-reducer.c[2384,2397] [2024-09-15 18:42:05,317 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+lhb-reducer.c[2599,2612] [2024-09-15 18:42:05,319 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+lhb-reducer.c[2901,2914] [2024-09-15 18:42:05,324 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+lhb-reducer.c[3116,3129] [2024-09-15 18:42:05,325 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+lhb-reducer.c[3386,3399] [2024-09-15 18:42:05,325 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+lhb-reducer.c[3604,3617] [2024-09-15 18:42:05,327 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+lhb-reducer.c[4088,4101] [2024-09-15 18:42:05,330 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+lhb-reducer.c[4306,4319] [2024-09-15 18:42:05,331 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+lhb-reducer.c[4802,4815] [2024-09-15 18:42:05,335 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+lhb-reducer.c[5203,5216] [2024-09-15 18:42:05,336 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+lhb-reducer.c[5421,5434] [2024-09-15 18:42:05,337 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+lhb-reducer.c[5792,5805] [2024-09-15 18:42:05,337 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+lhb-reducer.c[6010,6023] [2024-09-15 18:42:05,341 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+lhb-reducer.c[6296,6309] [2024-09-15 18:42:05,342 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+lhb-reducer.c[6514,6527] [2024-09-15 18:42:05,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:42:05,359 INFO L204 MainTranslator]: Completed translation [2024-09-15 18:42:05,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05 WrapperNode [2024-09-15 18:42:05,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 18:42:05,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 18:42:05,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 18:42:05,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 18:42:05,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,379 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 18:42:05,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 18:42:05,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 18:42:05,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 18:42:05,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 18:42:05,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,413 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 18:42:05,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 18:42:05,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 18:42:05,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 18:42:05,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 18:42:05,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (1/1) ... [2024-09-15 18:42:05,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:42:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 18:42:05,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 18:42:05,466 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 18:42:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 18:42:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 18:42:05,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 18:42:05,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 18:42:05,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 18:42:05,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 18:42:05,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 18:42:05,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 18:42:05,574 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 18:42:05,576 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 18:42:05,849 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-09-15 18:42:05,849 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 18:42:05,869 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 18:42:05,869 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 18:42:05,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05 BoogieIcfgContainer [2024-09-15 18:42:05,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 18:42:05,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 18:42:05,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 18:42:05,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 18:42:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 06:42:05" (1/3) ... [2024-09-15 18:42:05,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6437393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:42:05, skipping insertion in model container [2024-09-15 18:42:05,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:05" (2/3) ... [2024-09-15 18:42:05,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6437393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:42:05, skipping insertion in model container [2024-09-15 18:42:05,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05" (3/3) ... [2024-09-15 18:42:05,880 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-09-15 18:42:05,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 18:42:05,894 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-09-15 18:42:05,944 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 18:42:05,949 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60a84012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 18:42:05,949 INFO L337 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-09-15 18:42:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 18:42:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-15 18:42:05,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:05,962 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:05,962 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:05,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2024-09-15 18:42:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128333359] [2024-09-15 18:42:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128333359] [2024-09-15 18:42:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128333359] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396753288] [2024-09-15 18:42:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:06,279 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:06,299 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 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-09-15 18:42:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:06,529 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-09-15 18:42:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-15 18:42:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:06,537 INFO L225 Difference]: With dead ends: 89 [2024-09-15 18:42:06,538 INFO L226 Difference]: Without dead ends: 74 [2024-09-15 18:42:06,556 INFO L433 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-09-15 18:42:06,563 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:06,564 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 18:42:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-15 18:42:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-09-15 18:42:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-09-15 18:42:06,637 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-09-15 18:42:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:06,637 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-09-15 18:42:06,637 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:06,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-09-15 18:42:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-15 18:42:06,640 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:06,640 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:06,640 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 18:42:06,640 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:06,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2024-09-15 18:42:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302211527] [2024-09-15 18:42:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302211527] [2024-09-15 18:42:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302211527] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:06,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184185663] [2024-09-15 18:42:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:06,766 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:06,767 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:06,919 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-09-15 18:42:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-15 18:42:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:06,920 INFO L225 Difference]: With dead ends: 74 [2024-09-15 18:42:06,920 INFO L226 Difference]: Without dead ends: 72 [2024-09-15 18:42:06,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:06,922 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 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-09-15 18:42:06,922 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-15 18:42:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-09-15 18:42:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-09-15 18:42:06,937 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2024-09-15 18:42:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:06,937 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-09-15 18:42:06,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:06,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-09-15 18:42:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 18:42:06,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:06,939 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:06,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 18:42:06,939 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:06,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2024-09-15 18:42:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756727084] [2024-09-15 18:42:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756727084] [2024-09-15 18:42:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756727084] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:07,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:07,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:07,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455800507] [2024-09-15 18:42:07,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:07,047 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:07,048 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:07,233 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-15 18:42:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-15 18:42:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:07,234 INFO L225 Difference]: With dead ends: 72 [2024-09-15 18:42:07,235 INFO L226 Difference]: Without dead ends: 70 [2024-09-15 18:42:07,235 INFO L433 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-09-15 18:42:07,236 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 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.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:07,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-15 18:42:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-09-15 18:42:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) 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-09-15 18:42:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-15 18:42:07,246 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2024-09-15 18:42:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:07,247 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-15 18:42:07,247 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-15 18:42:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 18:42:07,249 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:07,249 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:07,249 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 18:42:07,249 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:07,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2024-09-15 18:42:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679884183] [2024-09-15 18:42:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679884183] [2024-09-15 18:42:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679884183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:07,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628029744] [2024-09-15 18:42:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:07,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:07,330 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:07,456 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-15 18:42:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-15 18:42:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:07,457 INFO L225 Difference]: With dead ends: 70 [2024-09-15 18:42:07,457 INFO L226 Difference]: Without dead ends: 68 [2024-09-15 18:42:07,458 INFO L433 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-09-15 18:42:07,459 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 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-09-15 18:42:07,461 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-15 18:42:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-15 18:42:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) 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-09-15 18:42:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-15 18:42:07,471 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2024-09-15 18:42:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:07,471 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-15 18:42:07,471 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-15 18:42:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 18:42:07,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:07,472 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:07,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 18:42:07,472 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:07,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2024-09-15 18:42:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834130522] [2024-09-15 18:42:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834130522] [2024-09-15 18:42:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834130522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977609441] [2024-09-15 18:42:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:07,560 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:07,561 INFO L87 Difference]: Start difference. First operand 66 states and 70 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-09-15 18:42:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:07,709 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-15 18:42:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:07,710 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-09-15 18:42:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:07,710 INFO L225 Difference]: With dead ends: 68 [2024-09-15 18:42:07,710 INFO L226 Difference]: Without dead ends: 66 [2024-09-15 18:42:07,711 INFO L433 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-09-15 18:42:07,711 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 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-09-15 18:42:07,711 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-15 18:42:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-15 18:42:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-09-15 18:42:07,725 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-09-15 18:42:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:07,725 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-09-15 18:42:07,725 INFO L475 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-09-15 18:42:07,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-09-15 18:42:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 18:42:07,726 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:07,726 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:07,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 18:42:07,727 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:07,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2024-09-15 18:42:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716600102] [2024-09-15 18:42:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716600102] [2024-09-15 18:42:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716600102] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:07,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:07,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383643520] [2024-09-15 18:42:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:07,781 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:07,782 INFO L87 Difference]: Start difference. First operand 64 states and 68 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-09-15 18:42:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:07,901 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-15 18:42:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:07,902 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-09-15 18:42:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:07,903 INFO L225 Difference]: With dead ends: 66 [2024-09-15 18:42:07,903 INFO L226 Difference]: Without dead ends: 64 [2024-09-15 18:42:07,903 INFO L433 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-09-15 18:42:07,905 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:07,905 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-15 18:42:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-15 18:42:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-09-15 18:42:07,913 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2024-09-15 18:42:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:07,913 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-09-15 18:42:07,913 INFO L475 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-09-15 18:42:07,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-09-15 18:42:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 18:42:07,914 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:07,914 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:07,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 18:42:07,915 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:07,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2024-09-15 18:42:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314536500] [2024-09-15 18:42:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:07,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:07,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314536500] [2024-09-15 18:42:07,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314536500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:07,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:07,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183123865] [2024-09-15 18:42:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:07,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:07,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:07,964 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,055 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-15 18:42:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-15 18:42:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,057 INFO L225 Difference]: With dead ends: 64 [2024-09-15 18:42:08,057 INFO L226 Difference]: Without dead ends: 60 [2024-09-15 18:42:08,057 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:08,058 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 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-09-15 18:42:08,058 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-15 18:42:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-09-15 18:42:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-15 18:42:08,065 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2024-09-15 18:42:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,066 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-15 18:42:08,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-15 18:42:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 18:42:08,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,067 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,067 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 18:42:08,067 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:08,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2024-09-15 18:42:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358757997] [2024-09-15 18:42:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358757997] [2024-09-15 18:42:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358757997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115734878] [2024-09-15 18:42:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,127 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:08,128 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,216 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-15 18:42:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:08,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-15 18:42:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,221 INFO L225 Difference]: With dead ends: 60 [2024-09-15 18:42:08,221 INFO L226 Difference]: Without dead ends: 56 [2024-09-15 18:42:08,222 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:08,222 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 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-09-15 18:42:08,222 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-15 18:42:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-15 18:42:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 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-09-15 18:42:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-09-15 18:42:08,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2024-09-15 18:42:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,228 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-09-15 18:42:08,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-09-15 18:42:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 18:42:08,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,229 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,229 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 18:42:08,229 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:08,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2024-09-15 18:42:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939010697] [2024-09-15 18:42:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939010697] [2024-09-15 18:42:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939010697] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453817913] [2024-09-15 18:42:08,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:08,329 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,452 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-15 18:42:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-15 18:42:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,454 INFO L225 Difference]: With dead ends: 88 [2024-09-15 18:42:08,454 INFO L226 Difference]: Without dead ends: 86 [2024-09-15 18:42:08,454 INFO L433 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-09-15 18:42:08,454 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:08,455 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 119 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-15 18:42:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2024-09-15 18:42:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-15 18:42:08,471 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-15 18:42:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,472 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-15 18:42:08,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-15 18:42:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 18:42:08,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,473 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 18:42:08,473 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:08,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2024-09-15 18:42:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870396840] [2024-09-15 18:42:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870396840] [2024-09-15 18:42:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870396840] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248403696] [2024-09-15 18:42:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,561 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:08,562 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,687 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-09-15 18:42:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-15 18:42:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,688 INFO L225 Difference]: With dead ends: 86 [2024-09-15 18:42:08,688 INFO L226 Difference]: Without dead ends: 84 [2024-09-15 18:42:08,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-15 18:42:08,689 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:08,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 147 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-15 18:42:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-09-15 18:42:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-09-15 18:42:08,697 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 16 [2024-09-15 18:42:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,697 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-09-15 18:42:08,697 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-09-15 18:42:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 18:42:08,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,700 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 18:42:08,700 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:08,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2024-09-15 18:42:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971141911] [2024-09-15 18:42:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971141911] [2024-09-15 18:42:08,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971141911] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980292699] [2024-09-15 18:42:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,752 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:08,752 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,854 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-09-15 18:42:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-15 18:42:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,855 INFO L225 Difference]: With dead ends: 62 [2024-09-15 18:42:08,856 INFO L226 Difference]: Without dead ends: 60 [2024-09-15 18:42:08,856 INFO L433 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-09-15 18:42:08,856 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 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-09-15 18:42:08,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-15 18:42:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-15 18:42:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-15 18:42:08,868 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-15 18:42:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,868 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-15 18:42:08,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-15 18:42:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 18:42:08,869 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,869 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,869 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 18:42:08,870 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:08,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2024-09-15 18:42:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020840324] [2024-09-15 18:42:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020840324] [2024-09-15 18:42:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020840324] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581548970] [2024-09-15 18:42:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,924 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:08,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:08,925 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,017 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-15 18:42:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:09,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-15 18:42:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,018 INFO L225 Difference]: With dead ends: 60 [2024-09-15 18:42:09,018 INFO L226 Difference]: Without dead ends: 58 [2024-09-15 18:42:09,019 INFO L433 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-09-15 18:42:09,019 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 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-09-15 18:42:09,019 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-15 18:42:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-15 18:42:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-15 18:42:09,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 16 [2024-09-15 18:42:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,027 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-15 18:42:09,027 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-15 18:42:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 18:42:09,029 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,029 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 18:42:09,030 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2024-09-15 18:42:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903501195] [2024-09-15 18:42:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903501195] [2024-09-15 18:42:09,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903501195] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476338891] [2024-09-15 18:42:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:09,083 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,178 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-15 18:42:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:09,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-15 18:42:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,179 INFO L225 Difference]: With dead ends: 58 [2024-09-15 18:42:09,180 INFO L226 Difference]: Without dead ends: 56 [2024-09-15 18:42:09,180 INFO L433 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-09-15 18:42:09,180 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,181 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-15 18:42:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-15 18:42:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-09-15 18:42:09,187 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2024-09-15 18:42:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,188 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-09-15 18:42:09,188 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-09-15 18:42:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 18:42:09,189 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,189 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,189 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-15 18:42:09,189 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2024-09-15 18:42:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266807658] [2024-09-15 18:42:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266807658] [2024-09-15 18:42:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266807658] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152534285] [2024-09-15 18:42:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,270 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:09,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:09,272 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,397 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-15 18:42:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:09,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-15 18:42:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,398 INFO L225 Difference]: With dead ends: 72 [2024-09-15 18:42:09,398 INFO L226 Difference]: Without dead ends: 70 [2024-09-15 18:42:09,399 INFO L433 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-09-15 18:42:09,399 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-15 18:42:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-09-15 18:42:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-15 18:42:09,406 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-09-15 18:42:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,407 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-15 18:42:09,407 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-15 18:42:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 18:42:09,408 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,408 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,408 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-15 18:42:09,408 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2024-09-15 18:42:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418557828] [2024-09-15 18:42:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418557828] [2024-09-15 18:42:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418557828] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812052326] [2024-09-15 18:42:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:09,494 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,608 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-15 18:42:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-15 18:42:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,609 INFO L225 Difference]: With dead ends: 73 [2024-09-15 18:42:09,609 INFO L226 Difference]: Without dead ends: 69 [2024-09-15 18:42:09,609 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-15 18:42:09,610 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,610 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-15 18:42:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-09-15 18:42:09,618 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-09-15 18:42:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-15 18:42:09,618 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-15 18:42:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,619 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-15 18:42:09,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-15 18:42:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-15 18:42:09,621 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,622 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,622 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-15 18:42:09,622 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2024-09-15 18:42:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632170854] [2024-09-15 18:42:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632170854] [2024-09-15 18:42:09,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632170854] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:09,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503343358] [2024-09-15 18:42:09,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:09,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:09,714 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,829 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-15 18:42:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-15 18:42:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,830 INFO L225 Difference]: With dead ends: 69 [2024-09-15 18:42:09,830 INFO L226 Difference]: Without dead ends: 67 [2024-09-15 18:42:09,831 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-15 18:42:09,831 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,831 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-15 18:42:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-15 18:42:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 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-09-15 18:42:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-09-15 18:42:09,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 18 [2024-09-15 18:42:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,839 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-09-15 18:42:09,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-09-15 18:42:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 18:42:09,840 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,840 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-15 18:42:09,840 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2024-09-15 18:42:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143685484] [2024-09-15 18:42:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143685484] [2024-09-15 18:42:09,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143685484] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810183755] [2024-09-15 18:42:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:09,879 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,944 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-15 18:42:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:09,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-15 18:42:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,945 INFO L225 Difference]: With dead ends: 65 [2024-09-15 18:42:09,945 INFO L226 Difference]: Without dead ends: 63 [2024-09-15 18:42:09,945 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:09,945 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 18:42:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-15 18:42:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-15 18:42:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) 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-09-15 18:42:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-15 18:42:09,951 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 19 [2024-09-15 18:42:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,951 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-15 18:42:09,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-15 18:42:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-15 18:42:09,952 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,952 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,952 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-15 18:42:09,952 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:09,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2024-09-15 18:42:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5433707] [2024-09-15 18:42:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5433707] [2024-09-15 18:42:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5433707] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418999279] [2024-09-15 18:42:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:09,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:09,989 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:10,053 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-09-15 18:42:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-15 18:42:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:10,053 INFO L225 Difference]: With dead ends: 63 [2024-09-15 18:42:10,054 INFO L226 Difference]: Without dead ends: 59 [2024-09-15 18:42:10,054 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:10,054 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 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.0s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:10,054 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 18:42:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-15 18:42:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-15 18:42:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-09-15 18:42:10,060 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2024-09-15 18:42:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:10,060 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-09-15 18:42:10,060 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:10,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-09-15 18:42:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 18:42:10,061 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:10,061 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:10,061 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-15 18:42:10,061 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:10,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1687468520, now seen corresponding path program 1 times [2024-09-15 18:42:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517484427] [2024-09-15 18:42:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:10,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517484427] [2024-09-15 18:42:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517484427] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 18:42:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456929846] [2024-09-15 18:42:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 18:42:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 18:42:10,145 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-09-15 18:42:10,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 18:42:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:10,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 18:42:10,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 18:42:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:10,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 18:42:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 18:42:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456929846] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 18:42:10,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 18:42:10,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-15 18:42:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838983744] [2024-09-15 18:42:10,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 18:42:10,488 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-15 18:42:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-15 18:42:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-15 18:42:10,489 INFO L87 Difference]: Start difference. First operand 59 states and 66 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-09-15 18:42:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:10,734 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-15 18:42:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-15 18:42:10,735 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-09-15 18:42:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:10,736 INFO L225 Difference]: With dead ends: 86 [2024-09-15 18:42:10,736 INFO L226 Difference]: Without dead ends: 84 [2024-09-15 18:42:10,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-15 18:42:10,736 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:10,737 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 139 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 18:42:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-15 18:42:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2024-09-15 18:42:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-09-15 18:42:10,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2024-09-15 18:42:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:10,744 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-09-15 18:42:10,744 INFO L475 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-09-15 18:42:10,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-09-15 18:42:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 18:42:10,745 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:10,745 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:10,759 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 18:42:10,945 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 18:42:10,946 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:10,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1687899496, now seen corresponding path program 1 times [2024-09-15 18:42:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933916134] [2024-09-15 18:42:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933916134] [2024-09-15 18:42:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933916134] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 18:42:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765284204] [2024-09-15 18:42:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 18:42:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 18:42:11,051 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-09-15 18:42:11,053 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-15 18:42:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 18:42:11,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 18:42:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:11,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 18:42:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 18:42:11,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765284204] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 18:42:11,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 18:42:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-15 18:42:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324060458] [2024-09-15 18:42:11,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 18:42:11,332 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-15 18:42:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-15 18:42:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-15 18:42:11,333 INFO L87 Difference]: Start difference. First operand 55 states and 62 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-09-15 18:42:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:11,529 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-09-15 18:42:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-15 18:42:11,530 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-09-15 18:42:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:11,530 INFO L225 Difference]: With dead ends: 82 [2024-09-15 18:42:11,530 INFO L226 Difference]: Without dead ends: 80 [2024-09-15 18:42:11,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-15 18:42:11,531 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:11,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 96 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-15 18:42:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 48. [2024-09-15 18:42:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-09-15 18:42:11,541 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 21 [2024-09-15 18:42:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:11,542 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-09-15 18:42:11,542 INFO L475 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-09-15 18:42:11,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-09-15 18:42:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 18:42:11,543 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:11,543 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:11,559 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 18:42:11,747 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 18:42:11,748 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:11,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 267428458, now seen corresponding path program 1 times [2024-09-15 18:42:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:11,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013137092] [2024-09-15 18:42:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013137092] [2024-09-15 18:42:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013137092] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:42:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318419301] [2024-09-15 18:42:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:11,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:42:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:42:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:11,829 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:11,919 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-15 18:42:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-15 18:42:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:11,920 INFO L225 Difference]: With dead ends: 48 [2024-09-15 18:42:11,920 INFO L226 Difference]: Without dead ends: 46 [2024-09-15 18:42:11,920 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:42:11,921 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:11,921 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-15 18:42:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-15 18:42:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-09-15 18:42:11,927 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2024-09-15 18:42:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:11,927 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-09-15 18:42:11,927 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:11,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-09-15 18:42:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 18:42:11,928 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:11,928 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:11,928 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-15 18:42:11,928 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:11,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1335654093, now seen corresponding path program 1 times [2024-09-15 18:42:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987840398] [2024-09-15 18:42:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:11,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987840398] [2024-09-15 18:42:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987840398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:12,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:12,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178722170] [2024-09-15 18:42:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:12,001 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:12,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:12,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:12,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:12,003 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:12,081 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-09-15 18:42:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:12,083 INFO L225 Difference]: With dead ends: 43 [2024-09-15 18:42:12,083 INFO L226 Difference]: Without dead ends: 41 [2024-09-15 18:42:12,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:42:12,084 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:12,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-15 18:42:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-15 18:42:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-15 18:42:12,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-09-15 18:42:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:12,092 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-15 18:42:12,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-15 18:42:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 18:42:12,093 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:12,093 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:12,094 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-15 18:42:12,094 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-15 18:42:12,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1287938843, now seen corresponding path program 1 times [2024-09-15 18:42:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472785158] [2024-09-15 18:42:12,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:12,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472785158] [2024-09-15 18:42:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472785158] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109053275] [2024-09-15 18:42:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:12,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:12,175 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:12,254 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-15 18:42:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:12,254 INFO L225 Difference]: With dead ends: 38 [2024-09-15 18:42:12,254 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 18:42:12,255 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-15 18:42:12,255 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:12,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 18:42:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 18:42:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 18:42:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 18:42:12,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-15 18:42:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:12,256 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 18:42:12,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-09-15 18:42:12,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 18:42:12,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 18:42:12,259 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-09-15 18:42:12,260 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-09-15 18:42:12,260 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-09-15 18:42:12,260 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-09-15 18:42:12,260 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-09-15 18:42:12,260 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-09-15 18:42:12,261 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-09-15 18:42:12,262 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-09-15 18:42:12,262 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-15 18:42:12,265 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:12,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 18:42:13,613 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 18:42:13,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 06:42:13 BoogieIcfgContainer [2024-09-15 18:42:13,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 18:42:13,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 18:42:13,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 18:42:13,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 18:42:13,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05" (3/4) ... [2024-09-15 18:42:13,629 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 18:42:13,631 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 18:42:13,631 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 18:42:13,636 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-09-15 18:42:13,637 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-15 18:42:13,638 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-15 18:42:13,638 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 18:42:13,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 18:42:13,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 18:42:13,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 18:42:13,718 INFO L158 Benchmark]: Toolchain (without parser) took 8663.40ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 45.9MB in the beginning and 172.6MB in the end (delta: -126.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,718 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 29.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 18:42:13,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.34ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 51.2MB in the end (delta: -5.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.72ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 50.3MB in the end (delta: 897.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 18:42:13,719 INFO L158 Benchmark]: Boogie Preprocessor took 46.78ms. Allocated memory is still 83.9MB. Free memory was 50.3MB in the beginning and 48.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,719 INFO L158 Benchmark]: RCFGBuilder took 442.67ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 53.5MB in the end (delta: -5.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,719 INFO L158 Benchmark]: TraceAbstraction took 7755.52ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 52.6MB in the beginning and 180.0MB in the end (delta: -127.4MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,719 INFO L158 Benchmark]: Witness Printer took 90.83ms. Allocated memory is still 234.9MB. Free memory was 180.0MB in the beginning and 172.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-15 18:42:13,722 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.10ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 29.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.34ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 51.2MB in the end (delta: -5.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.72ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 50.3MB in the end (delta: 897.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.78ms. Allocated memory is still 83.9MB. Free memory was 50.3MB in the beginning and 48.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.67ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 53.5MB in the end (delta: -5.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7755.52ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 52.6MB in the beginning and 180.0MB in the end (delta: -127.4MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. * Witness Printer took 90.83ms. Allocated memory is still 234.9MB. Free memory was 180.0MB in the beginning and 172.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 52]: 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: 72]: 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: 84]: 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: 114]: 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: 126]: 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: 142]: 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: 154]: 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: 176]: 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: 188]: 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: 224]: 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: 236]: 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: 278]: 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: 297]: 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: 309]: 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: 333]: 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: 345]: 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: 366]: 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: 378]: 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, 79 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1154 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1705 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3234 IncrementalHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 716 mSDtfsCounter, 3234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 181, 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, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 6 NumberOfNonLiveVariables, 259 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 18 specifications checked. All of them hold - InvariantResult [Line: 282]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 63]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && ((0 < main__t) || (main__t == 0))) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) RESULT: Ultimate proved your program to be correct! [2024-09-15 18:42:13,747 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE